After a scandal in which match-making algorithms were dependent on the two individual's names, he is trying to recover.'s clients discovered that his
Love is dependent on the individual
~A~, ~B~ and ~C~. As is busy dealing with unhappy clients, he has no time to create a program to demonstrate this. Surely, he has called upon your help!demonstrates this by using a love triangle consisting of 3 people,
You can read about here. In short, each person's name is applied to a non-random, mathematical function which returns a value ~[1, 10]~. The compatibility of two people are the sum of the two results from the function. Thus, the compatibility between two people is ~[2, 20]~.'s love match algorithm
Given 3 integers, three compatibilities between the three people (~(A, B)~, ~(B, C)~ and ~(A,C)~), find the maximum compatibility that ~A~, ~B~ and ~C~ can have with anyone.
3 space separated integers: the compatibilities explained above. The numbers are in the range ~[2, 20]~. It is guaranteed that the 3 compatibilities are possible.
3 space separated integers denoting the maximum compatibility of ~A~, ~B~ and ~C~ respectively. The numbers should be in the range ~[2, 20]~.
20 15 15
20 20 15