#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <unordered_map>
#include <map>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using lint = long long;
using namespace std;

const int MOD = 1000000007;

int main() {
    int A, B, C;
    cin >> A >> B >> C;

    int m = max(A, B);
    m = max(m, C);
    int mi = min(A, B);
    mi = min(mi, C);

    int res;

    if (B == m) {
        res = min(abs(B - A), abs(B - C));
        res = min(res, abs(B-C));
    }
    else {
        if (B == mi) {
            res = min(abs(B-A), abs(B-C));
            res = min(res, abs(A-C));
        }
    }

    cout << res << endl;
    return 0;
}