{"raw_statement":[{"iden":"problem statement","content":"You have three tasks, all of which need to be completed.\nFirst, you can complete any one task at cost $0$.\nThen, just after completing the $i$\\-th task, you can complete the $j$\\-th task at cost $|A_j - A_i|$.\nHere, $|x|$ denotes the absolute value of $x$.\nFind the minimum total cost required to complete all the task."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq A_1, A_2, A_3 \\leq 100$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A_1$ $A_2$ $A_3$"},{"iden":"sample input 1","content":"1 6 3"},{"iden":"sample output 1","content":"5\n\nWhen the tasks are completed in the following order, the total cost will be $5$, which is the minimum:\n\n*   Complete the first task at cost $0$.\n*   Complete the third task at cost $2$.\n*   Complete the second task at cost $3$."},{"iden":"sample input 2","content":"11 5 5"},{"iden":"sample output 2","content":"6"},{"iden":"sample input 3","content":"100 100 100"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}