//////////////////////////
// Author: lnyxj
// Time: 2024-11-27 10:48:38
///////////////////////////
// #pragma target("avx,avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define xx first
#define yy second
// #define int long long
// #define double long double
using namespace std;
const int N = 2000 + 3, M = 1e5 + 5, mod = 998244353, inv2 = mod + 1 >> 1, inf = 0x3f3f3f3f;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;

int T;
int ans[M];
vector<pii> qst[N];

void init() {
	// T = 1;
	// qst[2000].push_back({2000, 1});
	cin >> T;
	for (int i = 1; i <= T; ++ i) {
		int n, m;
		cin >> n >> m;
		if (n == 1) ans[i] = 1;
		else qst[n].push_back({m, i});
	}
}

void solve() {
	static int f[N][N];
	for (int j = 1; j < N; ++ j) 
		for (int i = j; i < N; ++ i) 
			f[j][i] = 1;
	for (int i = 2; i < N; ++ i) {
		// if (i % 512 == 0) cout << i << '\n' << flush;
		// const int cur = i & 1, las = cur ^ 1;
		// memset(f[cur], 0, sizeof f[cur]);
		for (int k = N - 1; k; -- k) {
            int j = N - 1 - k;
			for (; j - 7 >= k; j -= 8) {
                if ((f[k][k + j] += f[k][j]) >= mod) f[k][k + j] -= mod;
                if ((f[k][k + j - 1] += f[k][j - 1]) >= mod) f[k][k + j - 1] -= mod;
                if ((f[k][k + j - 2] += f[k][j - 2]) >= mod) f[k][k + j - 2] -= mod;
                if ((f[k][k + j - 3] += f[k][j - 3]) >= mod) f[k][k + j - 3] -= mod;
                if ((f[k][k + j - 4] += f[k][j - 4]) >= mod) f[k][k + j - 4] -= mod;
                if ((f[k][k + j - 5] += f[k][j - 5]) >= mod) f[k][k + j - 5] -= mod;
                if ((f[k][k + j - 6] += f[k][j - 6]) >= mod) f[k][k + j - 6] -= mod;
                if ((f[k][k + j - 7] += f[k][j - 7]) >= mod) f[k][k + j - 7] -= mod;
            }
			for (; j >= k; -- j)
                if ((f[k][k + j] += f[k][j]) >= mod) f[k][k + j] -= mod;
		}
		for (int k = N - 1; k > 1; -- k) {
            int j = k;
			for (; j + 7 <= N - 1; j += 8) {
                if ((f[k - 1][j] += f[k][j]) >= mod) f[k - 1][j] -= mod;
                if ((f[k - 1][j + 1] += f[k][j + 1]) >= mod) f[k - 1][j + 1] -= mod;
                if ((f[k - 1][j + 2] += f[k][j + 2]) >= mod) f[k - 1][j + 2] -= mod;
                if ((f[k - 1][j + 3] += f[k][j + 3]) >= mod) f[k - 1][j + 3] -= mod;
                if ((f[k - 1][j + 4] += f[k][j + 4]) >= mod) f[k - 1][j + 4] -= mod;
                if ((f[k - 1][j + 5] += f[k][j + 5]) >= mod) f[k - 1][j + 5] -= mod;
                if ((f[k - 1][j + 6] += f[k][j + 6]) >= mod) f[k - 1][j + 6] -= mod;
                if ((f[k - 1][j + 7] += f[k][j + 7]) >= mod) f[k - 1][j + 7] -= mod;
		    }
			for (; j <= N - 1; ++ j)
                if ((f[k - 1][j] += f[k][j]) >= mod) f[k - 1][j] -= mod;
        }
		for (auto [m, id] : qst[i]) 
			ans[id] = f[1][m];
	}
	for (int i = 1; i <= T; ++ i) cout << ans[i] << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	init(); solve();
	return 0;
}