#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#define exp -0.5
#define N 2005
using namespace std;
int T,n,m,pos[N],x,ans;
double f[N];
void init(){
    for(int i=0;i<N;i++) f[i]=-1;
}
double calc(int l,int now){
    if(now==m) return log(n-l+1)/log(2);
    if(f[l]>exp) return f[l];
    double res=0.0;
    for(int i=pos[now];i<pos[now+1];i++)
        res=max(res,calc(i+1,now+1)+log(i-l+1)/log(2));
    f[l]=res;
    return res;
}
int main(){
    scanf("%d",&T);
    while(T--){
        init();
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++) scanf("%d",&x),pos[i]=x+1;
        sort(pos+1,pos+1+m);
        ans=floor(calc(1,1)*1000000);
        printf("%d\n",ans);
    }
}