// 2024ICPCShenyangE 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <memory.h>

#define MOD 998244353
long long dp[2][2002][2002];

int main() {
	int t, n, m;
	
	cin >> t;
	while (t--) {
		cin >> n >> m;
		memset(dp, 0, sizeof(dp));
		for (int h = 1; h <= m; h++)
			dp[1][h][h] = 1;
		for (int i = 2; i <= n; i++) {
			for (int h = 1; h <= m; h++) {
				for (int d = 1; d <= h; d++) {
					dp[i % 2][h][d] = 0;
					for (int d1 = d; d1 <= h; d1++) {
						dp[i % 2][h][d] += (d < h ? dp[1 - i % 2][h - d][d1] : 0) + dp[1 - i % 2][h][d1];
						dp[i % 2][h][d] = dp[i % 2][h][d] % MOD;
					}
				}
			}
		}
		long long ans = 0;
		for (int d = 1; d <= m; d++)
			ans = (ans + dp[n % 2][m][d]) % MOD;
		cout << ans << endl;
	}
	return 0;
}