#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------

// a <= b

constexpr int DIFF = 3;

bool judge(ll a, ll b, ll c) {
    if(a!= c and a > 0 and b > 0 and c > 0) {
        if(a < b and b > c ) return true;
        if(a > b and b < c ) return true;
        return false;
    } else return false;
}

ll getCost(ll a, ll b, ll c, ll cost) {
    ll ans = LINF;
    FOR(i,0,DIFF) {
        FOR(j,0,DIFF) {
            FOR(k,0,DIFF) {
                if(judge(a-i, b-j, c-k)) chmin(ans, cost+i+j+k);
            }
        }
    }
    return ans==LINF? -1: ans;
}

void solve() {
    ll a,b,c; cin >> a >> b >> c;
    ll cur;
    if(a <= b and b >= c) {
       cur = 0; 
    }
    else if(a > b and b < c) {
        cur = 0;
    }
    else if(a <= b and b < c) {
        cur = c - b-1;
        c = b+1;
    }
    else if(a > b and b >= c) {
        cur = a-b-1;
        a = b+1;
    }

    // cout << a << b << c <<cur <<endl;
    cout << getCost(a, b, c, cur) << endl;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    int T; cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}