#pragma GCC target("avx,sse2,sse3,sse4,popcnt")
#pragma GCC optimize("O2,O3,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
using namespace std;
#define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define all(__vv__) (__vv__).begin(), (__vv__).end()
#define endl "\n"
#define pai pair<int, int>
#define mk(__x__,__y__) make_pair(__x__,__y__)
#define ms(__x__,__val__) memset(__x__, __val__, sizeof(__x__))
typedef long long ll; typedef unsigned long long ull; typedef long double ld;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
inline ll read() { ll s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == '-') w = -1; for (; isdigit(ch); ch = getchar())    s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; }
inline void print(ll x) { if (!x) { putchar('0'); return; } char F[40]; ll tmp = x > 0 ? x : -x; if (x < 0)putchar('-');    int cnt = 0;    while (tmp > 0) { F[cnt++] = tmp % 10 + '0';        tmp /= 10; }    while (cnt > 0)putchar(F[--cnt]); }
inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll qpow(ll a, ll b) { ll ans = 1;    while (b) { if (b & 1)    ans *= a;        b >>= 1;        a *= a; }    return ans; }    ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; }
inline int lowbit(int x) { return x & (-x); }

int dp[1005][1005], ans[1005][1005];
int dfs(int x, int y) {
    if (ans[x][y] or x == 1 or y == 1) return ans[x][y];
    ans[x][y] = ans[y][x] = max(dfs(x - 1, y), dfs(x, y - 1)) + dp[x][y];
    return ans[x][y];
}
int main() {
    for (int i = 1; i <= 1000; ++i) {
        ans[i][1] = ans[1][i] = i;
        for (int j = i; j <= 1000; ++j) {
            if (gcd(i, j) == 1) dp[i][j] = dp[j][i] = 1;
            else dp[i][j] = dp[j][i] = 0;
        }
    }
    dfs(1000, 1000);
    int T = read();
    while (T--) {
        int a = read(), b = read();
        print(ans[a][b]), putchar(10);
    }
    return 0;
}