A magician told his friend(X) that he will do a magic trick and gave X 3 cards with 5 distinct non-negative integers written on each card. X was asked to choose a number from each card and tell the sum of the 3 chosen numbers to him. For every possible sum X told him, he answered all the 3 chosen numbers correctly. If you sum all these possible sums, what is the minimum value it can take?

Note: The integers on a card are distinct but integers on two different cards may not be distinct.

**My solution is wrong- bold text added later.**

**e r a s e d**

*Edited on ***November 4, 2012, 5:05 am**