# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)

struct INIT{
    INIT(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        cout << fixed << setprecision(13);
    }
}INIT;

bool iskado(int a, int b, int c){
    if(a == b || a == c || b == c)return false;
    int num = a + b + c - max({a, b, c}) - min({a, b, c});
    if(num == a || num == c)return true;
    return false;
}

int t;
int a, b, c;


void solve(){
    cin >> a >> b >> c;
    int ans = HINF<int>();
    if(iskado(a, b, c)){
        cout << 0 << endl;
        return;
    }
    if(a < b && b < c && a >= 2){
        ans = min(ans, b - (a - 1));
    }
    if(c < b && b < a && c >= 2){
        ans = min(ans, b - (c - 1));
    }
    if(a == b){
        if(b - c == 1){
            if(a >= 3)ans = min(ans, 2);
        }
        else if(b == c){
            if(a >= 3)ans = min(ans, 3);
        }
        else{
            ans = min(ans, 1);
        }
    }
    if(b == c){
        if(b - a == 1){
            if(c >= 3)ans = min(ans, 2);
        }
        else if(b == a){
            if(c >= 3)ans = min(ans, 3);
        }
        else{
            ans = min(ans, 1);
        }
    }
    if(a == c){
        if(b > a && a >= 2){
            ans = min(ans, 1);
        }
        if(b >= 2 && a >= 3){
            ans = min(ans, b - (a - 2) + 1);
        }
    }

    cout << (ans == HINF<int>() ? -1 : ans) << endl;
}

int main(){
    cin >> t;
    REP(ttt, t)solve();
}