#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 2550
#define M (1<<18|5)
#define mod 998244353
#define poly std::vector<int>
IL int read()
{
    reg int x=0,f=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){long long r=1ll*x*y; return r<mod?r:r%mod;}
IL int power(reg int x,reg int p){reg int r=1; for(;p;p>>=1,x=Mul(x,x))if(p&1)r=Mul(r,x); return r;}

const int Mod=1e7+9,bas=233;
int testid,n,m,tot;
int fir[Mod+5],nxt[Mod];
poly val[Mod];

IL bool ins(poly A)
{
    reg int ha=0;
    for(auto x:A)ha=(1ll*bas*ha+x)%Mod;
    for(reg int i=fir[ha];i;i=nxt[i])
        if(val[i]==A)return 0;
    nxt[++tot]=fir[ha],val[tot]=A,fir[ha]=tot;
    return 1;
}

void dfs(poly A)
{
    if(!ins(A))return; reg int mx=0;
    for(reg int i=0,j;i<A.size();++i)if(A[i]>mx)
    {
        poly B;
        mx=A[i];
        for(j=i+1;j<A.size();++j)if(i!=j)B.push_back(A[j]);
        if(mx>1)B.push_back(mx-1);
        dfs(B);
    }
}

int pw[N],a[N];

IL void work()
{
    n=read(),m=read();
    for(reg int i=1;i<=n;++i)a[i]=read();
    poly A; tot=0;
    for(reg int i=0;i<Mod;++i)fir[i]=0;
    for(reg int i=1;i<=n;++i)A.push_back(a[i]);
    dfs(A),printf("%d\n",tot-1);
    return;
}

main()
{
    freopen("seal.in","r",stdin);
    freopen("seal.out","w",stdout);
    testid=read();
    for(reg int t=read();t--;work());
}