#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(n)  n.begin(),n.end()
#define sz(n) (ll) n.size()
#define endl '\n'
const ll mod = 1e9 + 7;

void test_case() {
    vector<ll> ar(3,0);
    for (ll i=0; i<3; i++) cin >> ar[i];
    sort(all(ar));
    if (ar[0] == ar[2]) {
        cout << 0 << endl;
        return;
    }
    if (ar[0] == ar[1]) {
        cout << 1 << endl;
        return;
    }
    if (ar[1] == ar[2]) {
        cout << 1 << endl;
        return;
    }
    ll mn = __gcd(ar[1] - ar[0],ar[2] - ar[1]);
    cout << ((ar[1] - ar[0])/mn) + ((ar[2] - ar[1])/mn) << endl;
}

int32_t main() {
    //freopen("input.txt","r", stdin);
    //freopen("output.txt","w", stdout);
    //cout << fixed << setprecision(6);
    //priority_queue<ll,vector<ll>,greater<ll>> minH;
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    cin >> t;
    while(t--) {
        test_case();
    }
}