#include <bits/stdc++.h>
#include <cstdio>
#define int long long
#define PII pair<int, int>
#pragma GCC optimize("Ofast")
#define NO {puts("No") ; return ;}
#define YES {puts("Yes") ; return ;}
#define pb push_back
#define endl "\n"
#define fi first
#define se second
#define IOS std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
mt19937 rd(time(0));
const int N = 1e5 + 10;
int n, m; 
void calc1(int x, int y) {
	if (y > x) swap(x, y);
	cout << (x + 1) / 2 << endl;
}

void solve() {
	cin >> n >> m;
	if (n == 1 && m == 1) {
		cout << 1 << endl;
		return ;
	}
	if (n == 1 || m == 1) {
		calc1(n, m);
		return ;
	}

	if (n >= 4) {
		n %= 3;
	}

	if (m >= 4) {
		m %= 3;
	}

	if (n == 1 && m == 1) {
		cout << 2 << endl;
	} else {
		if (n == 1 && m == 2) {
			cout << 1 << endl;
			return ;
		} else if (n == 1 && m == 3) {
			cout << 2 << endl;
			return ;
		} else if (n == 2 && m == 2) {
			cout << 1 << endl;
			return ;
		} else if (n == 2 && m == 3) {
			cout << 2 << endl;
			return ;
		} else if (n == 3 && m == 3) {
			cout << 2 << endl;
			return ;
		}

		swap(n, m);
		if (n == 1 && m == 2) {
			cout << 1 << endl;
			return ;
		} else if (n == 1 && m == 3) {
			cout << 2 << endl;
			return ;
		} else if (n == 2 && m == 2) {
			cout << 1 << endl;
			return ;
		} else if (n == 2 && m == 3) {
			cout << 2 << endl;
			return ;
		} else if (n == 3 && m == 3) {
			cout << 2 << endl;
			return ;
		}
	}
} 

signed main() {
    IOS;
    int t; cin >> t;
    while (t -- ) 
    solve();
    
    return 0;
}