#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define read(a) scanf("%d", &a)
#define x first
#define y second

#define N 1005
int dp[N][N];

int main() {
    int T;
    scanf("%d", &T);
    int n = 1000;
    for (int i = 1; i <= n; i++) {
        dp[i][1] = dp[1][i] = i;
    }
    for (int i = 2; i <= n; i++) {
        for (int j = 2; j <= n; j++) {
            dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]) + (__gcd(i, j) == 1);
        }
    }
    while (T--) {
        int x, y;
        scanf("%d%d", &x, &y);
        printf("%d\n", dp[x][y]);
    }
}