#include<bits/stdc++.h>
#define int long long
#define i128 __int128
#define MAXN 270010
#define p 998244353
using namespace std;
const int N=200000;
const int S=2000;
int qpow(int x,int y){
	int ret=1;
	for(;y;y>>=1,x=x*x%p)if(y&1)ret=ret*x%p;
	return ret;
}
int add(int x,int y){return x+y<p?x+y:x+y-p;}
int del(int x,int y){return x-y<0?x-y+p:x-y;}
int T,n,m;
int f[N/S+5][MAXN],g[MAXN],tmp[MAXN];
int fac[MAXN],ifac[MAXN];
int C(int x,int y){return x<y?0:fac[x]*ifac[y]%p*ifac[x-y]%p;}
namespace Poly{
	const int G=3;
	int rev[MAXN],lmt,l;
	void init(int len){
		lmt=1,l=0;while(lmt<len)lmt<<=1,l++;
		for(int i=0;i<lmt;i++)rev[i]=(rev[i>>1]>>1)|((i&1)<<(l-1));
	}
	void NTT(int *A,int sgn){
		for(int i=0;i<lmt;i++)
			if(i<rev[i])swap(A[i],A[rev[i]]);
		for(int mid=1;mid<lmt;mid<<=1){
			int Wn=qpow(G,(p-1)/(mid<<1));
			if(sgn==-1)Wn=qpow(Wn,p-2);
			for(int j=0,R=mid<<1;j<lmt;j+=R)
				for(int k=0,w=1;k<mid;k++,w=w*Wn%p){
					int x=A[j+k],y=A[j+k+mid]*w%p;
					A[j+k]=add(x,y);A[j+k+mid]=del(x,y);
				}
		}int inv=qpow(lmt,p-2);
		if(sgn==-1)
			for(int i=0;i<lmt;i++)
				A[i]=A[i]*inv%p;
	}
}
using namespace Poly;
int calc(int n,int k){
	int bel=k/S,del=k-bel*S;i128 ret=0;
	for(int i=0;i<=del&&i<=n;i++)ret+=C(del,i)*f[bel][n-i];
	return ret%p;
}
signed main(){
	freopen("qwq.in","r",stdin);
	freopen("qwq.out","w",stdout);
	init(N+S+1);//cerr<<lmt<<endl;
	fac[0]=1;for(int i=1;i<=N;i++)fac[i]=fac[i-1]*i%p;
	ifac[N]=qpow(fac[N],p-2);
	for(int i=N;i;i--)ifac[i-1]=ifac[i]*i%p;
	for(int i=0;i<=S;i++)g[i]=C(S,i);
	NTT(g,1);f[0][0]=1;
	for(int i=1;i<=N;i++)f[0][i]=(i-1)*(f[0][i-1]+(i>1?f[0][i-2]:0))%p;
	for(int i=1;i<=N/(2*S);i++){//cerr<<i<<endl;
		memcpy(tmp,f[i-1],sizeof(tmp));
		NTT(tmp,1);
		for(int j=0;j<lmt;j++)f[i][j]=tmp[j]*g[j]%p;
		NTT(f[i],-1);
		for(int j=N+1;j<lmt;j++)f[i][j]=0;
	}
	scanf("%lld",&T);
	while(T--){
		scanf("%lld%lld",&n,&m);
		if(2*m>n){puts("0");continue;}
		printf("%lld\n",C(n-m,m)*fac[m]%p*calc(n-m,m)%p);
	}
	return 0;
}