#include<bits/stdc++.h>
#define ll long long 
using namespace std;
const ll mod=998244353;
ll fac[200005],ifac[200005];
void add(ll &x,const ll y){if((x+=y)>=mod)x-=mod;}
void sub(ll &x,const ll y){if((x+=(mod-y))>=mod)x-=mod;}
ll qpow(ll a,ll b){
	ll res=1ll;
	while(b){if(b&1ll)res=res*a%mod;a=a*a%mod;b>>=1;}
	return res;
}
void init(){
	fac[0]=ifac[0]=1ll;
	for(int i=1;i<=200000;++i)fac[i]=fac[i-1]*1ll*i%mod,ifac[i]=qpow(fac[i],mod-2);
}
ll comb(int N,int M){
	return fac[N]*ifac[M]%mod*ifac[N-M]%mod;
}
ll A(int N,int M){
	return fac[N]*ifac[N-M]%mod;
}
ll solve(int N,int M){
	if(2*M>N)return 0ll;
	ll res=0ll;
	for(int i=0;i<=N-M&&N-M-i>=M;++i)
	 if(i&1)sub(res,A(N-M-i,M)*ifac[i]%mod);
	 else add(res,A(N-M-i,M)*ifac[i]%mod);
	return res;
}
int main() {
	init(); 
	int t;cin>>t;
	while(t--){
		int N,M;
		scanf("%d%d",&N,&M);
		printf("%lld\n",solve(N,M));
	}
	return 0;
}