#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

void solve() {
    ll a, b, c;
    cin >> a >> b >> c;
    if (a < c) swap(a, c);
    ll ans = LONG_LONG_MAX;
    if (b >= 3) {
        ll am = max(0LL, a - b + 1);
        ll cm = max(0LL, c - (a - am) + 1);
        if ((am < a) && (cm < c)) ans = min(ans, am + cm);
    }
    if (a >= 3) {
        ll cm = max(0LL, c - a + 1);
        ll bm = max(0LL, b - (c - cm) + 1);
        if ((cm < c) && (bm < b)) ans = min(ans, cm + bm);
    }
    if (ans == LONG_LONG_MAX) cout << -1 << endl;
    else cout << ans << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll t;
    cin >> t;
    rep(i, t) solve();
    return 0;
}