#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn=1000+10;

int f[maxn][maxn];

int main()
{
    int t,i,j;
    f[1][1]=0;
    for (i=1;i<=1000;i++)
        for (j=1;j<=1000;j++)
            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;
}