#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int i=0;i<(n);i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) ((int)(x).size()) #define pb push_back #define mod 1000000007 using ll = long long; using namespace std; ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;} ll lcm(ll a, ll b) {return a/gcd(a,b)*b;} int main(){ int T; cin >> T; rep(t,T){ int A, B, C; cin >> A >> B >> C; int ans = 0; if(A == B && B == C){ ans = A-2>0?3:-1; } else{ // B is max int a = A, b = B, c = C; int ans1 = 0; ans1 += max(0,a-(b-1)); a = min(a,b-1); ans1 += max(0,c-(b-1)); c = min(c,b-1); if(a==c) { ans1++;a--; } if(a<=0) ans1 = 2e9+5; // B is min a = A; b = B; c = C; int ans2 = 0; ans2 += max(0,b-(min(a,c)-1)); b = min(b,min(a,c)-1); if(a==c) ans2 += 2; if(a-2<=0 || b<=0) ans2 = 2e9+5; ans = min(ans1,ans2); if(ans == 2e9+5) ans = -1; } cout << ans << endl; } return 0; }