#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int maxn=2505;
int read(){
    int ret=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
    while( isdigit(ch)){ret=(ret<<3)+(ret<<1)+(ch&15);ch=getchar();}
    return ret*f;
}
int c,T,n,m,ans;
queue<long long> Q;
int a[maxn],tmp[maxn];
long long calc(){
    long long ret=0,base=1;
    for(int i=1;i<=n;++i){
        if(!a[i]) break;
        ret=ret+base*a[i];
        base=base*(m+1);
    }
    return ret;
}
void deco(long long v){
    for(int i=1;i<=n;++i) tmp[i]=0;
    int id=0;
    while(v){
        tmp[++id]=v%(m+1);
        v/=(m+1);
    }
}
map<long long,bool> vis;
void BFS(){
    long long v=calc();
    Q.push(v);vis.clear();
    vis[v]=1;
    while(!Q.empty()){
        long long now=Q.front();
        Q.pop();deco(now);
        int mx=0;
        for(int i=1;i<=n;++i){
            if(tmp[i]>mx){
                for(int i=1;i<=n;++i) a[i]=0;
                for(int j=1;1;++j){
                    a[j]=tmp[i+j];
                    if(!tmp[i+j]){
                        if(tmp[i]!=1) a[j]=tmp[i]-1;
                        break;
                    }
                }
                long long v=calc();
                if(!vis[v]){
                    vis[v]=1;
                    Q.push(v);
                }
            }
            mx=max(mx,tmp[i]);
        }
    }
}
void solve(){
    n=read();m=read();
    for(int i=1;i<=n;++i) a[i]=read();
    BFS();ans=-1;
    for(auto i:vis) ans=(ans+1)%mod;
    printf("%d\n",ans);
}
int main(){
    freopen("seal.in","r",stdin);
    freopen("seal.out","w",stdout);
    c=read(),T=read();
    while(T--) solve();
    return 0;
}