#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
using namespace std;
const int N=2e3+10,M=1e6+20,mod=998244353;
int f[2][N+10][N+10],g[2][N+10][N+10],h[N+10][N+10];
void init(int k){
	f[0][0][0]=f[1][0][0]=g[0][0][0]=g[1][0][0]=1;
	int lim=k==1?N:(N-k)/(k-1);
	for(int i=0;i<=N;i++){
		for(int j=0;j<=lim;j++){
			if(!i&&!j) continue;
			f[0][i][j]=((!j?0:g[1][i][j-1])-(j-k-1<0?0:g[1][i][j-k-1])+mod)%mod;
			f[1][i][j]=((!i?0:g[0][i-1][j])-(i-k-1<0?0:g[0][i-k-1][j])+mod)%mod;
			g[0][i][j]=((!i?0:g[0][i-1][j])+f[0][i][j])%mod;
			g[1][i][j]=((!j?0:g[1][i][j-1])+f[1][i][j])%mod;
			if(i>=j&&(i+j)/(j+1)==k) h[i][j]=(f[0][i][j]+f[1][i][j])%mod;
		}
	}
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	for(int i=1;i<=N;i++) init(i);
	int T;cin>>T;
	while(T--){
		int x,y;cin>>x>>y;
		if(x<y) swap(x,y);
		cout<<h[x][y]<<'\n';
	}
	return 0;
}
//