#include<bits/stdc++.h>
using namespace std;
#define REP(i,x,y) for(register int i=(x); i<(y); i++)
#define REPE(i,x,y) for(register int i=(x); i<=(y); i++)
#define MAXN 30
#ifdef sahdsg
#define DBG(...) printf(__VA_ARGS__);
#else
#define DBG(...)
#endif
typedef pair<int,int> pii;
bool arr[220];
int md;
int n,tot;
int counter(bool *arr, pii *stick) {int s=0;bool k=true;k=true;REPE(sz,1,n) {REPE(ax,0,n-sz) REPE(ay,0,n-sz) {k=true;REP(i,0,sz) {if(arr[ax+ay*(n+n+1)+i]) {k=false;break;}}if(k)REP(i,0,sz) {if(arr[ax+(ay+i)*(n+n+1)+n] || arr[ax+(ay+i)*(n+n+1)+n+sz]) {k=false;break;}}if(k)REP(i,0,sz) {if(arr[ax+(ay+sz)*(n+n+1)+i]) {k=false;break;}}if(k){s++;REPE(bx,0,n-sz) REPE(by,0,n-sz) {REP(i,0,sz) {stick[bx+by*(n+n+1)+i].first++;}REP(i,0,sz) {stick[bx+(by+i)*(n+n+1)+n].first++;stick[bx+(by+i)*(n+n+1)+n+sz].first++;}REP(i,0,sz) {stick[bx+(by+sz)*(n+n+1)+i].first++;}}}}}return s;
}
bool solve(int d, bool *oarr) {pii stick[220];REP(i,0,tot) stick[i].second=i,stick[i].first=0;int s=counter(oarr,stick);if(s==0) return true;sort(stick,stick+tot,greater<pii>());if(stick[0].first==1) {md+=s;return true;}int sum=0, k=999999;REP(i,0,tot) {sum+=stick[i].first;if(sum>=s) {k=i+1; break;}}if(k+d>md) return false;REP(i,0,tot) {if(oarr[stick[i].second]) continue;oarr[stick[i].second]=1;if(solve(d+1,oarr)) return true;oarr[stick[i].second]=0;}return 0;
}
int main() {
#ifdef sahdsgfreopen("in.txt", "r", stdin);
#endifint T;scanf("%d",&T);while(0<T--) {scanf("%d",&n);tot=2*n*(n+1);int d;scanf("%d",&d);memset(arr,0,sizeof arr);REP(i,0,d) {int t;scanf("%d",&t);arr[t]=1;}for(md=0; ; md++) {DBG("#%d", md);if(solve(0,arr)) {printf("%d\n", md);break;}}}return 0;
}