import java.util.*; import java.io.*; import java.math.BigInteger; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); for (int i = 0; i < n; i ++) { solve(ni(), ni()); } } private static void solve(long a, long b) { // a + b + 2sqrt(ab) < x^2 // x^2 - a - b > 2sqrt(ab) // (x^2 - a- b)^2 > 4ab long ok = (int)Math.sqrt(1e9) * 2 + 100; long ng = 0; var p = BigInteger.valueOf(4L * a * b); while (Math.abs(ok - ng) > 1) { long x = (ok + ng) / 2; var q = BigInteger.valueOf(x * x - a - b).pow(2); if (q.compareTo(p) > 0) { ok = x; } else { ng = x; } } out.println(ok); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { solve(); out.flush(); } }, "", 64000000).start(); } private static PrintWriter out = new PrintWriter(System.out); private static StringTokenizer tokenizer = null; private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768); public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } }