#include<cstdio>
#include<cmath>
#include<cstring>
#define int long long
using namespace std;
int t,n,k,ord[15];
const int mod=998244353;
bool vis[15];
int ans=0;
void dfs(int K){
    if(K==2*n+1){
        int num=0;
        for(int i=2;i<=2*n;i+=2){
            if(abs(ord[i]-ord[i-1])==1&&(ord[i]+1)/2==(ord[i-1]+1)/2)num++;
        }
        if(num==k){
            ans++;
            ans%=mod;
        }
//        for(int i=1;i<=2*n;i++){
//            printf("%lld ",ord[i]);
//        }
//        printf("%lld\n",num);
        return;
    }
    for(int i=1;i<=2*n;i++){
        if(vis[i])continue;
        vis[i]=1;
        ord[K]=i;
        dfs(K+1);
        vis[i]=0;
        ord[K]=0;
    }
}
signed main(){
    freopen("love.in","r",stdin);
    freopen("love.out","w",stdout);
    scanf("%lld",&t);
    while(t--){
        ans=0;
        memset(vis,0,sizeof(vis));
        memset(ord,0,sizeof(ord));
        scanf("%lld%lld",&n,&k);
        dfs(1);
        printf("%lld\n",ans);
    }
    return 0;
}