#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

vector<vector<ll>> dp;

bool ins(ll i, ll j, ll n) {
	if(i < 0 || j < 0 || i > n || j > n) {
		return false;
	}
	return true;
}

void insert(const ll n, ll a, ll b) {

	//cerr << "\ninsert " << a << " ; " << b;

	for(ll i = n; i >= 1; i--) {
		for(ll j = n; j >= 1; j--) {
			if(ins(i - a, j - b, n) && dp[i-a][j-b] != 0) {
				dp[i][j] = dp[i-a][j-b] + 1;
			}
		}
	}

	/*
	cerr << "\ndp=\n";
	for(ll i = 1; i <= n; i++) {
		for(ll j = 1; j <= n; j++) {
			cerr << dp[i][j] << " ";
		}
		cerr << "\n";
	}
	*/

}

void pre(const ll n) {
	
	// we can easily count all valid pairs in O(n^2)
	// which at n=500 is easy-peasy
	// the question comes for how to use those valid pairs
	// 'cause I'm dead certain there's some dp logic behind this all

	dp.assign(n+1, vector<ll>(n+1, 0));
	dp[1][1] = 1;

	for(ll i = 1; i <= n; i++) {
		for(ll j = i+1; j <= n; j++) {
			
			// ha jo par
			// insert

			if(gcd(i, j) == 1) {
				insert(n, i, j);
				insert(n, j, i);
			}
		}
	}
}

void solve() {

	ll a, b;
	cin >> a >> b;
	
	ll mx = 0;

	for(ll i = a; i >= 1; i--) {
		for(ll j = b; j >= 1; j--) {
			mx = max(mx, dp[i][j]);
		}
	}

	cout << mx << "\n";
}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	pre(100);
	
	ll tests = 0;
	cin >> tests;
 
	while(tests--)
	{
		solve();
	}

	return 0;
}