#include<bits/stdc++.h>
#define int long long

const int N=2503,mod=998244353;

int read(){
	int x=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<3)+(x<<1)+(ch^48);
		ch=getchar();
	}
	return x*f; 
}

using namespace std;	

int n,m,res;
vector<int> a;
map<vector<int>,bool> st;
int maxp[N];

void solve(){
	n=read(),m=read(),res=0;
	st.clear();a.clear();a.push_back(-1);
	for(int i=1;i<=n;++i) a.push_back(read());
	queue<vector<int> >q;
	q.push(a);
	while(!q.empty()){
		vector<int> t=q.front();q.pop();
		memset(maxp,0,sizeof maxp);
//		cerr<<"t. ";
//		for(int x:t) cerr<<x<<' ';
//		cerr<<endl;
		//cerr<<"maxp. ";
		for(int i=1;i<t.size();++i){
			if(t[i]>t[maxp[i-1]]) maxp[i]=i;
			else maxp[i]=maxp[i-1];
			//cerr<<maxp[i]<<' ';
		}
		//cerr<<endl;
		for(int i=1;i<t.size();++i){
			if(maxp[i]==i){
				//cerr<<"i. "<<i<<endl;
				vector<int> tmp;
				tmp.push_back(-1);
				for(int j=i+1;j<t.size();++j){
					tmp.push_back(t[j]);
				}
				if(t[i]!=1) tmp.push_back(t[i]-1);
				if(!st[tmp]){
//					cerr<<"tmp. ";
//					for(int x:tmp) cerr<<x<<' ';
//					cerr<<endl;
					st[tmp]=1;
					res++;
					q.push(tmp);
				}
			}
		}
	}
	cout<<res<<'\n';
}

signed main(){
	freopen("seal.in","r",stdin);
	freopen("seal.out","w",stdout);
	int c=read(),T=read();
	while(T--) solve();
	return 0;
}