#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<string.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int Maxn=2003;
int a[Maxn];
int n,m;
double dp[Maxn][Maxn];
int main(){
    int _;scanf("%d",&_);
    while(_--){
        scanf("%d%d",&n,&m);
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=m;i++)scanf("%d",a+i),a[i]++;
        sort(a+1,a+m+1);
        a[m+1]=n+1;
        for(int i=1;i<=m;i++){
            for(int j=a[i-1];j<a[i];j++){
                for(int k=a[i];k<a[i+1];k++){
                    dp[i][k]=max(dp[i][k],dp[i-1][j]+log2(k-j));
                }
            }
        }
        double ans=floor(dp[m][n]*1000000);
        printf("%.0f\n",(ans+0.3));
    }
}