#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull bas=13331;
int n,C,T,ans,m;
unordered_map<ull,int>mapp;
void dfs(deque<int>a){
	ull k=0;
	for(int i=0;i<a.size();i++){
		k=k*bas+a[i];
	}
	if(mapp[k]==0&&a.size()!=0){
		mapp[k]=1;
		ans++;
	}
	else return ;
	int MAXX=0;
	for(int i=0;i<a.size();i++){
		if(MAXX<a[i]){
			MAXX=a[i];
			if(a[i]!=1){
				a.push_back(a[i]-1);
				int qaq[300],tot=0;
				for(int j=i;j>=0;j--){
					qaq[++tot]=a[j];
				}
				for(int j=0;j<=i;j++){
					a.pop_front();
				}
				dfs(a);
				for(int j=1;j<=tot;j++){
					a.push_front(qaq[j]);
				}
				a.pop_back();
			}
			else{
				int qaq[300],tot=0;
				for(int j=i;j>=0;j--){
					qaq[++tot]=a[j];
				}
				for(int j=0;j<=i;j++){
					a.pop_front();
				}
				dfs(a);
				for(int j=1;j<=tot;j++){
					a.push_front(qaq[j]);
				}
			}
		}
	}
}
int main(){
	freopen("seal.in","r",stdin);
	freopen("seal.out","w",stdout);
	cin>>C>>T;
	while(T--){
		cin>>n>>m;
		deque<int>a;
		for(int i=1;i<=n;i++){
			int x;
			cin>>x;
			a.push_back(x);
		}
		ans=0;
		mapp.clear();
		dfs(a);
		cout<<ans<<"\n";
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}