#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define ld long double
#define FOR(i,n,m) for(int i=(n);i<=(m);i++)
#define ROF(i,n,m) for(int i=(n);i>=(m);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define SZ(v) v.size()
#define PII pair<int, int>
#define FI(v) v.first
#define SE(v) v.second
#define BG(v) v.begin()
#define ED(v) v.end()
#define ALL(v) BG(v), ED(v)
#define endl '\n'
template < typename A, typename B >
inline bool chmax(A &x, B y) { return (x < y ? (x = y, true) : false); }
template < typename A, typename B >
inline bool chmin(A &x, B y) { return (x > y ? (x = y, true) : false); }
const int N = 12;
const int INF = 1e9 + 7;
int n, a, b, c[N];
vector<PII> e;
mt19937 rnd(time(0));
void solve() {
	cin >> a >> b;
	n = a + b;
	e.clear();
	FOR(i, 1, n) FOR(j, i + 1, n) e.push_back({i, j});
	FOR(i, 1, n) c[i] = 0;
	FOR(i, 1, a) c[i] = 1;
	int ans = INF;
	REP(_, 1000) {
		shuffle(ALL(e), rnd);
		int res = 0;
		REP(_, 1000) {
			shuffle(c + 1, c + n + 1, rnd);
			int cnt = 0;
			for(auto h : e) {
				cnt ++;
				if(c[FI(h)] && c[SE(h)]) break;
			}
			chmax(res, cnt);
		}
		chmin(ans, res);
	}
	cout << ans << endl;
}
int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T; cin >> T;
	while(T --) solve();
	return 0;
}