#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;

const int N=2e5,B=450;

//const int N=10,B=20;
int inv[2*N+5],fac[2*N+5],ifac[2*N+5];
int f[B+5][N+5];
int T,a,b,n,m;
inline int calc(int x,int y,int i,int b){// x=f[i],y=f[i-1]
    return 1ll*(1ll*(i+b)*x+1ll*y)%mod*inv[i+1]%mod;
}
inline int ksm(int x,int y){
	int res=1;
	while (y){
		if (y&1) res=1ll*res*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return res;
}
//int g[N+5];
//int tcalc(int a,int b){
//	g[0]=1,g[1]=b;
//	for (int i=1;i<a;++i) g[i+1]=1ll*(1ll*g[i]*(i+b)+1ll*g[i-1])%mod*inv[i+1]%mod;
//	return g[a];
//}
int main(){
    freopen("qwq.in","r",stdin);
    freopen("qwq.out","w",stdout);
    fac[0]=fac[1]=1;
    inv[1]=1;for (int i=2;i<=2*N;++i) inv[i]=mod-1ll*(mod/i)*inv[mod%i]%mod,fac[i]=1ll*fac[i-1]*i%mod;
    ifac[2*N]=ksm(fac[2*N],mod-2);for (int i=2*N-1;i>=0;--i) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
    for (int i=0;i<=B;++i){
        int b=i*B;
        f[i][0]=1,f[i][1]=b;
        for (int j=1;j<=N;++j) f[i][j+1]=calc(f[i][j],f[i][j-1],j,b);
    }
    scanf("%d",&T);
    while (T--){
        scanf("%d%d",&n,&m);
        if (2*m>n){
            puts("0");
            continue;
        }
        a=n-2*m,b=m;
        int k=(b+B-1)/B;
        int f0=f[k][a],f1=f[k][a+1];
        if (a){
	        for (int i=k*B;i>b;--i){
	            int f2=(1ll*(a+1)*f1%mod-1ll*(a+i)*f0%mod+mod)%mod;
	            f1=(f1-f0+mod)%mod;
	            f0=(f0-f2+mod)%mod;
	        }
		}
        int ans=1ll*f0*fac[n-m]%mod*fac[m]%mod;
        printf("%d\n",ans);
    }
    return 0;
}