#include <iostream>
#include <set>
#include <queue>
#include <algorithm>

using namespace std;

long long boxes[100];
size_t bs=0;
int n;

long long k=0ll;

long long shift[64];

struct ms
{
	long long disappear;
	int k;
};

int main()
{
	for(int i=1;i<64;i++)
		shift[i]=(1ll << i);

	int t;
	cin >> t;
	while(t--)
	{
		ms a;
		cin >> n;
		int s;
		cin >> s;
		a.disappear =0ll;

		bs=0;
		for(int width=1;width<=n;width++)
		{				
			for(int x=1;x<=n-width+1;x++)
				for(int y=1;y<=n-width+1;y++)
				{			
					long long bit=0ll;
					int us=(y-1)*(2*n+1)+x;
					for(int i=us;i<us+width;i++)
						bit |= shift[i];

					int ds=us+(2*n+1)*width;
					for(int i=ds;i<ds+width;i++)
						bit |= shift[i];

					int ls=us+n;
					for(int i=ls;i<ls+width*(2*n+1);i+=(2*n+1))
						bit |= shift[i];

					int rs=ls+width;
					for(int i=rs;i<rs+width*(2*n+1);i+=(2*n+1))
						bit |= shift[i];

					boxes[bs++]=bit;
				}
		}

		for(int i=0;i<s;i++)
		{
			int tt;
			cin >> tt;
			a.disappear |= shift[tt];
		}

		queue<ms> q;
		a.k=0;
		q.push(a);
		bool found=false;
		long long tempc=0ll;
		int mm=n*2*(n+1);
		while(!found && !q.empty())
		{
			ms c=q.front();
			q.pop();
			
			for(int i=c.k+1;i<=mm;i++)
			if((c.disappear & shift[i])==0)
			{				
				tempc=c.disappear;
				c.disappear |= shift[i];

				found=true;
				for(size_t j=0;j<bs;j++)
					if((boxes[j] & c.disappear) == 0)
					{
						found=false;
						break;
					}

					
				if(found){
					int cnt=0;
					for(int j=1;j<=mm;j++)
						if((c.disappear & shift[j]) != 0 )
							cnt++;

					cout <<(int)cnt - s << endl;
					break;
				}
				c.k=i;
				q.push(c);
				c.disappear=tempc;
			}
		}
	}
}