#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    vector<int> k(3);
    rep(i,3) cin >> k[i];
    sort(k.begin(),k.end());
    cout << min(k[2]-k[1],k[1]-k[0]) << endl;
    return 0;
}