#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e3+50,mod=998244353;

int T,n,a[N],c,cm[N];

int solve(int l,int r,int x,int y)
{
    if(l>n||r<1)return 1;
    if(x+y>r-l+1)return cm[r-l+1];
    if(r-l+1<=c)return cm[x]*cm[y]%mod;
    int mi=1e9,pos=0;
    for(int i=l;i<=r;i++)if(a[i]<mi)mi=a[i],pos=i;
    if(pos>l+x-1&&pos<r-y+1)return solve(l,pos-1,x,(pos-l>=c)?c:0)*solve(pos+1,r,(r-pos>=c)?c:0,y)%mod;
    if(pos<l+x)
    {
        swap(a[pos],a[l]);
        return solve(l+1,r,c+x-1,y)*x%mod;
    }
    swap(a[pos],a[r]);
    return solve(l,r-1,x,y+c-1)*y%mod;
}

void sol()
{
    cin>>n>>c;
    cm[0]=1;
    for(int i=1;i<=n;i++)cin>>a[i],cm[i]=cm[i-1]*i%mod;
    cout<<solve(1,n,0,0)<<'\n';
}

main()
{
    // freopen("in.txt","r",stdin);
    cin>>T;
    while(T--)sol();
}