//Δ_1003
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1111;
int gcd(int x,int y){
    if(!y)
        return x;
    return gcd(y,x%y);
}
int n=1000,f[N][N];
int main()
{
    int T,i,j;
    for(i=1;i<=n;i=i+1)
        for(j=1;j<=n;j=j+1)
            f[i][j]=max(f[i-1][j],f[i][j-1])+(gcd(i,j)==1);
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&i,&j);
        printf("%d\n",f[i][j]);
    }
    return 0;
}