package contest200113; import java.io.PrintWriter; import java.util.Arrays; import java.util.Scanner; // 列挙漏れ public class C2 { static Scanner in; static PrintWriter out; static String INPUT = ""; static void solve() { int T = ni(); if(!(1 <= T && T <= 10000))throw new RuntimeException(); for(int i = 0;i < T;i++) { int A = ni(), B = ni(), C = ni(); if(!(1 <= A && A <= 1000000000))throw new RuntimeException(); if(!(1 <= B && B <= 1000000000))throw new RuntimeException(); if(!(1 <= C && C <= 1000000000))throw new RuntimeException(); int ans = Integer.MAX_VALUE; ans = Math.min(ans, cost(C, A, B)); ans = Math.min(ans, cost(A, C, B)); ans = Math.min(ans, cost(B, A, C)); // ans = Math.min(ans, cost(B, C, A)); out.println(ans == Integer.MAX_VALUE ? -1 : ans); } } static int cost(int a, int b, int c) { int ret = 0; if(b >= c) { ret += b-c+1; b = c-1; } if(a >= b) { ret += a-b+1; a = b-1; } if(a <= 0)return Integer.MAX_VALUE; return ret; } public static void main(String[] args) throws Exception { in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT); out = new PrintWriter(System.out); solve(); out.flush(); } static int ni() { return Integer.parseInt(in.next()); } static long nl() { return Long.parseLong(in.next()); } static double nd() { return Double.parseDouble(in.next()); } static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }