#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=998244353;
int a[2505];
map<int,int>q;
int cnt,ans;
int b[2505];
void dfs(int now)
{
    int has=0;
    for(int i=1;i<=now;i++)
        has=has*31+b[i];
    if(q[has]||now==0)return;
    q[has]++;
    ans++;
    int maxn=-1;
    int c[15];
    for(int i=1;i<=now;i++)c[i]=b[i];
    for(int i=1;i<=now;i++)
    {
        if(maxn<b[i])
        {
            maxn=b[i];
            int no=now;
            if(b[i]!=1)b[++no]=b[i]-1;
            for(int j=i+1;j<=no;j++)
                b[j-i]=b[j];
            dfs(no-i);
            for(int j=1;j<=now;j++)b[j]=c[j];
        }
    }
}
signed main()
{
    freopen("seal.in","r",stdin);
    freopen("seal.out","w",stdout);
    int c,t;
    cin>>c>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
        ans=0;
        dfs(n);
        cout<<ans<<"\n";
        q.clear();
        memset(b,0,sizeof(b));
    }
}