#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int t; cin >> t; rep(loop, t){ int a, b, c; cin >> a >> b >> c; if(a > c)swap(a, c); int tmp1 = 2002002002; int tmp2 = 2002002002; if(a >= 2 && b >= 1 && c >= 3){ tmp1 = 0; int x = a, y = b, z = c; if(x == z){ x--; tmp1++; } if(y >= x){ tmp1 += y - x + 1; } } if(a >= 1 && b >= 3 && c >= 2){ tmp2 = 0; if(b <= c){ tmp2 += c - b + 1; c = b - 1; } if(c <= a){ tmp2 += a - c + 1; a = c - 1; } } int ans = min(tmp1, tmp2); if(ans == 2002002002)ans = -1; cout << ans << endl; } return 0; }