#include<bits/stdc++.h>
#define int unsigned long long
using namespace std;
const int N=2e6+5,p=233;
int n,m,a[N];
map<int,bool>s;
inline int read(){int x(0),f(1);char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);return x*f;}
inline void dfs(int l,int r,int b[]){
	if(l>r) return;
	int res=0;
	for(register int i=l;i<=r;i++) res=res*p+b[i];
	if(s[res]) return;
	s[res]=1;
	int pre=0;
	for(register int i=l;i<=r;i++){
		if(b[i]>pre){
			pre=b[i];
			b[r+1]=b[i]-1;
			dfs(i+1,r+(b[r+1]!=0),b);
		}
	}
}
signed main(){
	freopen("seal.in","r",stdin);
	freopen("seal.out","w",stdout);
	read();int T=read();
	while(T--){
		s.clear();
		n=read(),m=read();
		for(register int i=1;i<=n;i++) a[i]=read();
		dfs(1,n,a);
		printf("%d\n",s.size());
	}
	return 0;
}
/*
0 1
11 10
8 8 8 9 9 8 8 9 9 9 8

*/