{"problem":{"name":"Task Scheduling Problem","description":{"content":"You have three tasks, all of which need to be completed. First, you can complete any one task at cost $0$. Then, just after completing the $i$\\-th task, you can complete the $j$\\-th task at cost $|A_j","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc103_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq A_1, A_2, A_3 \\leq 100$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A_1$ $A_2$ $A_3$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc103_a","tags":[],"sample_group":[["1 6 3","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$."],["11 5 5","6"],["100 100 100","0"]],"created_at":"2026-03-03 11:01:14"}}