#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 1007;
int ans[N][N];
int gcd(int a, int b)
{
    while(b>0)
        return gcd(b,a%b);
    return a;
}
int dfs(int x, int y)
{
    if(ans[x][y] != -1) return ans[x][y];
    if(gcd(x, y) == 1) ans[x][y] = 1;
    else ans[x][y] = 0;

    if(x > 1 && y > 1) 
        ans[x][y] += max(dfs(x - 1, y), dfs(x, y - 1));

    else if(x > 1) 
        ans[x][y] += dfs(x - 1, y);

    else if(y > 1) 
        ans[x][y] += dfs(x, y - 1);

    return ans[x][y];
}
void init()
{
    for(int i=0;i<N;i++)
    {
        for(int j=0;j<N;j++)
        {
            ans[i][j]=-1;
        }
    }
}
int main()
{
    std::ios::sync_with_stdio(false);
    int T;
    cin >> T;
    init();
    while(T --)
    {
        int a, b;
        cin>>a>>b;
        cout<<dfs(a,b)<<endl;
    }
    return 0;
}