#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <map>
#include <set>
#include <string>
using namespace std;
int a[1005][1005];

int panduan(int m,int n)
{
    if(m%n==0) return n;
    else return panduan(n,m%n);
}

void init()
{
    for (int i=1;i<=1000;i++)
    {
        for (int j=1;j<=1000;j++)
        {
            a[i][j]=max(a[i][j-1],a[i-1][j]);
            if(panduan(i,j)==1) a[i][j]++;
        }
    }
}
int main()
{
    init();
//    cout << a[10][10] << " " << a[3][5] << endl;
    int t;
    scanf("%d",&t);
    getchar();
    for (int i=1;i<=t;i++)
    {
        int n,m;
        scanf("%d %d",&n,&m);
        getchar();
        printf("%d\n",a[n][m]);
    }
    return 0;
}