#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void Solve()
{
    ll arr[3];
    for (ll i = 0; i < 3; i++)
        cin >> arr[i];
    sort(arr, arr + 3);
    ll d1 = arr[1] - arr[0], d2 = arr[2] - arr[1];
    ll k = __gcd(d1, d2);
    if (k == 0) {
        cout << "0\n";
    } else {
        cout << (d1 / k) + (d2 / k) << "\n";
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        Solve();
    return 0;
}