import static java.util.Comparator.comparing;

import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==========================================================
    public void solve() {
    	int T = ni();
    	int[] ABC;
    	for (int i = 0; i < T; i++) {
			ABC = ndi(3);
			if(ABC[0] < ABC[1] && ABC[1] < ABC[2]) {
				if(ABC[0] <= 1) {
					out.println(-1);
				} else if(ABC[1] - ABC[0] <= ABC[2] - ABC[1]) {
					out.println(ABC[1] - ABC[0] + 1);
				} else {
					out.println(ABC[2] - ABC[1] + 1);
				}
			} else if(ABC[2] < ABC[1] && ABC[1] < ABC[0]) {
				if(ABC[2] <= 1) {
					out.println(-1);
				} else if(ABC[1] - ABC[2] <= ABC[0] - ABC[1]) {
					out.println(ABC[1] - ABC[2] + 1);
				} else {
					out.println(ABC[2] - ABC[0] + 1);
				}
			} else if(ABC[0] == ABC[1] && ABC[1] == ABC[2]) {
				if(ABC[0] >= 3) {
					out.println(3);
				} else {
					out.println(-1);
				}
			} else if(ABC[0] == ABC[1] && ABC[1] < ABC[2]) {
				if(ABC[0] <= 1) {
					out.println(-1);
				} else {
					out.println(1);
				}
			} else if(ABC[0] == ABC[1] && ABC[1] > ABC[2]) {
				if(ABC[2] <= 1) {
					out.println(-1);
				} else {
					out.println(ABC[1] - ABC[2] + 1);
				}
			} else if(ABC[0] > ABC[1] && ABC[1] == ABC[2]) {
				if(ABC[1] <= 1) {
					out.println(-1);
				} else {
					out.println(1);
				}
			} else if(ABC[0] < ABC[1] && ABC[1] == ABC[2]) {
				if(ABC[0] <= 1) {
					out.println(-1);
				} else {
					out.println(ABC[1] - ABC[0] + 1);
				}
			} else {
				out.println(0);
			}
		}
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}