#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define foru(a,b,c) for(ll a=b;a<=c;a++)
#define endl '\n'

ll t,a[20005],ans,n,k;
bool b[20005];

void dfs(ll stp){
    ll sum=0;
    if(stp==(n<<1|1)){
        for(ll i=1;i<=n*2;i+=2){
            if((a[i]+1)/2==(a[i+1]+1)/2){
                sum++;
            }
        }
        if(sum==k)ans=(ans+1)%998244353;
    }
    foru(i,1,(n<<1)){
        if(!b[i]){
            a[stp]=i;
            b[i]=1;
            dfs(stp+1);
            b[i]=0;
        }
    }
}

void init(){
    ans=0;
    cin>>n>>k;
    foru(i,1,(n<<1)){
        b[i]=0;
    }
    dfs(1);
    cout<<ans<<endl;
}

int main() {
	freopen("love.in","r",stdin);
	freopen("love.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while(t--){
	    init();
    }
	return 0;
}