#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

static int GreatestCommonDen(int a, int b)
{
    while (b != 0)
    {
        int r = a % b;
        a = b;
        b = r;
    }
    return a;
}

int main()
{
    vector<vector<int>> dp;
    dp.resize(501, vector<int>(501,0));
    for (int x = 1; x < 32; x++)
    {
        for (int y = 1; y < 32; y++)
        {
            if (GreatestCommonDen(x, y) == 1)
            {
                for (int i = 500; i >= x; i--)
                {
                    for (int j = 500; j >= y; j--)
                    {
                        dp[i][j] = max(dp[i][j], dp[i - x][j - y] + 1);
                    }
                }
            }
        }
    }
    int a, b;
    int n;
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> a >> b;
        cout << dp[a][b] << "\n";
    }
}