#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
int ans[6][6];
int main() {
//	freopen("in.txt", "r", stdin);
	ans[2][2] = 5;
	ans[2][3] = 18;
	ans[3][3] = 150;
	ans[2][4] = 73;
	ans[3][4] = 1533;
	ans[4][4] = 31828;
	ans[5][5] = 12785753;
	ans[4][5] = 469972;
	ans[3][5] = 11398;
	ans[2][5] = 267;
	for(int T = read(); T; T --) {
		int n = read(), m = read();
		if(n > m) swap(n, m);
		cout << ans[n][m] << '\n';
	}
	return 0;
}