#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int N=1001,Inf=1e9+7;
int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int dp[N][N];//dp[i][j]=i,j为初始时互质的次数
/*
dp[i][j]=max(dp[i-1][j],dp[i][j-1])+(gcd(i,j)==1);
*/ 
void cal(){
    for(int i=1;i<N;++i){
        for(int j=1;j<N;++j)
            dp[i][j]=max(dp[i-1][j],dp[i][j-1])+(gcd(i,j)==1);
    }
}
int n,a,b;
int main(){
    cal();
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d %d",&a,&b);
        printf("%d\n",dp[a][b]);
    }
    return 0;
}