#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<int> vc;
    for (int i = 0; i < 3; i++) {
        int n;
        cin >> n;
        vc.push_back(n);
    }
    sort(vc.begin(), vc.end());
    int ab = max(vc.at(0) - vc.at(1), vc.at(1) - vc.at(0));
    int bc = max(vc.at(1) - vc.at(2), vc.at(2) - vc.at(1));
    cout << min(ab, bc) << "\n";
    return 0;
}