import java.util.Arrays;
import java.util.Scanner;

public class Main{

	public static void main(String[] args) 
	{
		Scanner s = new Scanner(System.in);		
		int taskCost[] = new int[3];
		for(int i = 0; i< 3 ; i++)
		{
			taskCost[i] = s.nextInt();
		}
		int minCost = 0;
		Arrays.sort(taskCost);
		for(int i = 1; i>= 0; i--)
		{
			minCost = minCost + Math.abs(taskCost[i+1]-taskCost[i]);
		}
		System.out.println(minCost);

	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz