#include<bits/stdc++.h>
using namespace std;
const int N=2505;
map<vector<int>,bool> mp;
int n,m,a[N];
void dfs(vector<int> cur){
	if(cur.empty() or mp.find(cur)!=mp.end()) return;
	int mx=0;mp[cur]=true;
	for(int i=0;i<cur.size();i++){
		if(cur[i]>mx){
			vector<int> nxt;
			for(int j=i+1;j<cur.size();j++)
				nxt.push_back(cur[j]);
			if(cur[i]>1) nxt.push_back(cur[i]-1);
			dfs(nxt);
		}
		mx=max(mx,cur[i]);
	}
}
int main(){
	freopen("seal.in","r",stdin);
	freopen("seal.out","w",stdout);
	ios::sync_with_stdio(false),cin.tie(nullptr);
	int cid,Tsk;cin>>cid>>Tsk;
	while(Tsk--){
		cin>>n>>m;vector<int> v;mp.clear();
		for(int i=1;i<=n;i++) cin>>a[i],v.push_back(a[i]);
		dfs(v);
		cout<<(mp.size())<<"\n";
	}
	return 0;
}
/*FOOTNOTE
对于 B 性质，任何一个数被加到末尾之后还是升序，
操作等价于 
*/