/*
Author:Rosabel
Contest:LHSX 2025 Day 2
Time:2025.3.2
Problem:seal
Calm down!
Think carefully and type.
*/
#include<bits/stdc++.h>
#define ll long long
#define pi pair<int,int>
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define lc tr[i].ch[0]
#define rc tr[i].ch[1]
#define Lc tr[j].ch[0]
#define Rc tr[j].ch[1]
#define REP(i,l,r) for(int i=(l);i<=(r);i++)
#define PER(i,r,l) for(int i=(r);i>=(l);i--)
#define lowbit(i) (i&(-i))
#define abs Abs
using namespace std;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+c-'0';
        c=getchar();
    }
    return x*f;
}
void write(int x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
map<vector<int>,bool>mp;
int ans;
void dfs(vector<int>f){
    int maxn=0;
    if(mp[f]||f.empty())return;
    mp[f]=1;
    ++ans;
    for(auto x:f){
        if(x<=maxn)continue;
        maxn=x;
        bool flag=0;
        vector<int>g;
        for(auto y:f){
            if(flag)g.push_back(y);
            if(y==maxn)flag=1;
        }
        if(maxn-1)g.push_back(maxn-1);
        dfs(g);
    }
}
int solve(){
    int n=read(),m=read();
    vector<int>f(n,0);
    REP(i,0,n-1)f[i]=read();
    ans=0;mp.clear();
    dfs(f);
    return ans;
}
int main(){
    freopen("seal.in","r",stdin);
    freopen("seal.out","w",stdout);
    int c=read(),T=read();
    while(T--)write(solve()),putchar('\n');
    return 0;
}