#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
int qpow(int a, int b) {
	if (!b) return 1;
	int t = qpow(a, b >> 1);
	t = mul(t, t);
	if (b & 1) return mul(t, a);
	return t;
}
const int maxT = 200000, V = 200000, B = 500;
int bl[V + 5];
struct query {
	int l, r, id;
	bool operator<(const query& b) const {
		if (bl[l] != bl[b.l]) return l < b.l;
		return bl[l] & 1 ? r > b.r : r < b.r;
	}
} q[maxT + 5];
int qc;
int D[V + 5];
int fac[V + 5], ifac[V + 5];
int inv[V + 5];
void init() {
	D[2] = 1;
	for (int i = 3; i <= V; i++) D[i] = mul(add(D[i - 1], D[i - 2]), i - 1);
	fac[0] = 1;
	for (int i = 1; i <= V; i++) fac[i] = mul(fac[i - 1], i);
	ifac[V] = qpow(fac[V], mod - 2);
	for (int i = V - 1; ~i; i--) ifac[i] = mul(ifac[i + 1], i + 1);
	for (int i = 1; i <= V; i++) inv[i] = mul(ifac[i], fac[i - 1]);
}
int ans[maxT + 5];
int main() {
	int T;
	scanf("%d", &T);
	init();
	for (int t = 1; t <= T; t++) {
		int n, m;
		scanf("%d%d", &n, &m);
		if (!m) ans[t] = D[n];
		else if (n == 2 * m) ans[t] = mul(fac[m], fac[m]);
		else if (n > 2 * m) {
			ans[t] = mul(fac[n - m], ifac[n - 2 * m]);
			q[++qc] = {n - 2 * m, m, t};
		}
	}
	for (int i = 0; i <= V; i++) bl[i] = i / B;
	sort(q + 1, q + qc + 1);
	int x = 1, y = 1, v1 = 1, v2 = 3;
	for (int i = 1; i <= qc; i++) {
		while (q[i].l < x) {
			v2 = mul(sub(v2, mul(v1, x + y + 1)), inv[x]);
			swap(v1, v2);
			x--;
		}
		while (y < q[i].r) {
			int t = add(v1, v2);
			v2 = add(mul(v1, x + 1), mul(v2, x + y + 2)), v1 = t;
			y++;
		}
		while (x < q[i].l) {
			v1 = add(mul(v1, x + 1), mul(v2, x + y + 1));
			swap(v1, v2);
			x++;
		}
		while (q[i].r < y) {
			int t = mul(sub(v2, mul(v1, x + 1)), inv[y]);
			v1 = sub(v1, t), v2 = t;
			y--;
		}
		ans[q[i].id] = mul(ans[q[i].id], v1);
	}
	for (int t = 1; t <= T; t++) printf("%d\n", ans[t]);
}