#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}


const long long INF = 1LL<<60;

bool isok(long long a, long long b, long long c) {
    if (a < 1 || b < 1 || c < 1) return false;
    if (a == b) return false;
    if (b == c) return false;
    if (c == a) return false;
    if (a < b && b < c) return false;
    if (a > b && b > c) return false;
    return true;
}

long long A, B, C;

long long solve() {
    if (isok(A, B, C)) return 0;
    
    long long mi = min(min(A, B), C);
    long long ma = max(max(A, B), C);

    if (ma - mi <= 50) {
        long long res = INF;
        for (int a = 0; a <= 200; ++a) {
            for (int b = 0; b <= 200; ++b) {
                for (int c = 0; c <= 200; ++c) {
                    if (isok(A-a, B-b, C-c)) {
                        chmin(res, (long long)(a + b + c));
                    }
                }
            }
        }
        if (res < INF) return res;
        else return -1;
    }
    else {
        if (A == 1 || C == 1) return -1;
        if (A == 2 && B == 2) return -1;
        
        long long res = INF;
        if (A <= B && B <= C) {
            chmin(res, abs(B - (A-1)));
            chmin(res, abs(C - (B-1 != A ? B-1 : A-1)));
        }
        else {
            chmin(res, abs(B - (C-1)));
            chmin(res, abs(A - (B-1 != C ? B-1 : C-1)));
        }
        return res;
    }
}


int main() {
    int T; cin >> T;
    for (int _ = 0; _ < T; ++_) {
        cin >> A >> B >> C;
        cout << solve() << endl;
    }
}