Given position of 3 stones at x axis. (x,y,z) respectively You have to make these 3 stones consecutive by following operation Pick a stone with lowest or highest position and put it in between lowest and highest ex. if (2,4,7) are positions then you can either pick 2 or 7 and put in between (2-7) except 4. Return an array of 2 size with minimum and maximum move to achieve consecutive position.
Input Format
3 Integer x,y,z
Output Format
array of size 2
Constraints
1 <= x, y, z <= 100 x, y, and z have different values.
Notice
NA
Example
Input
1 2 5
Output
1 2