#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)
using namespace std;
typedef long long ll;

char buf[1 << 23], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1 ++)
int read() {
	int s(0), f(1); char ch(getchar());
	while (!isdigit(ch)) f = ch == '-' ? -1 : 1, ch = getchar();
	while (isdigit(ch)) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int N = 2000, M = N + 5, mod = 998244353;
int f[M][M][2], g[M][M][2], h[M][M];
void upd(int& x, int y) {((x += y) >= mod) && (x -= mod);}

void init(int K) {
	int up = (K == 1 ? N : (N - K) / (K - 1));
	f[0][0][0] = f[0][0][1] = g[0][0][0] = g[0][0][1] = 1;
	rep(i, 0, N) {
		rep(j, 0, up) {
			if (!i && !j) continue;
			f[i][j][0] = (i ? g[i - 1][j][1] : 0);
			if (i - K - 1 >= 0) upd(f[i][j][0], mod - g[i - K - 1][j][1]);
			f[i][j][1] = (j ? g[i][j - 1][0] : 0);
			if (j - K - 1 >= 0) upd(f[i][j][1], mod - g[i][j - K - 1][0]);
			g[i][j][0] = f[i][j][0], g[i][j][1] = f[i][j][1];
			if (i) upd(g[i][j][1], g[i - 1][j][1]);
			if (j) upd(g[i][j][0], g[i][j - 1][0]);
			if (i >= j && (i + j) / (j + 1) == K) 
				upd(h[i][j], f[i][j][0]), upd(h[i][j], f[i][j][1]);
		}
	}
}

int main() {
	rep(i, 1, N) init(i);
	int T = read();
	while (T --) {
		int n = read(), m = read();
		if (n < m) swap(n, m);
		printf("%d\n", h[n][m]);
	}
	return 0;
}