#include<bits/stdc++.h>
using namespace std;
const int mod=998244353,N=2000;
int f[2010][2010],g[2010][2010],an[2010][2010];
void ad(int &x,int y){x+=y;if(x>=mod)x-=mod;}
int main(){
    for(int t=1;t<=N;t++){
        int yo=0;
        for(int y=1;y<=N&&(y+1)*t-y<=N;y++)yo=y;if(!yo)break;
        for(int i=0;i<=N;i++)for(int j=0;j<=yo;j++)f[i][j]=g[i][j]=0;
        f[0][0]=g[0][0]=1,g[0][1]=mod-1,f[1][0]=mod-1;
        for(int i=0;i<=N;i++){
            for(int j=0;j<=yo;j++){
                if(i)ad(f[i][j],f[i-1][j]);
                ad(g[i][j+1],f[i][j]);
                if(j+t+1<=yo)ad(g[i][j+t+1],mod-f[i][j]);
                if(j)ad(g[i][j],g[i][j-1]);
                ad(f[i+1][j],g[i][j]);
                if(i+t+1<=N)ad(f[i+t+1][j],mod-g[i][j]);
            }
        }
        for(int y=1;y<=yo;y++)for(int x=max(y,t*(y+1)-y);x<(t+1)*(y+1)-y&&x<=N;x++){
            an[x][y]=(f[x][y]+g[x][y])%mod;
        }
        //x>=(y+1)t-y
        //t<=(x+y)/(y+1)<t+1
    }
    int T,x,y;scanf("%d",&T);
    while(T--){
        scanf("%d%d",&x,&y);if(x<y)swap(x,y);
        if(x==y)puts("2");
        else printf("%d\n",an[x][y]);
    }
    return 0;
}