//毒瘤題
//整整一下午才調好

暴力列舉，除了這個沒有別的什麼辦法
可以用hash來剪枝
hash儲存每種狀態的最小值
雖然敲起來很心累，但收穫還是不少的

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;
#define ll long long
#define de cout<<1;

const int maxn = 40;
int T,n;
int a[maxn];
map<ll, int>q;

int
 
 read() {
    int x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') {
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + ch - '0';
        ch = getchar();
    }
    return x * f;
}

ll haha() {
    ll sum
 
 = 0;
    for(int i = 3; i <= 16; i++) {
        sum = sum * 6 + a[i];
    }
    return sum;
}

int work() {
    int zp = haha();
    if(zp == 0) return 0;
    if(q.count(zp)) return q[zp];
    int sum = 60;
    int flag = 0;
    //3 shun
    for(int i = 3; i <= 13; i++) {
        if(a[i] >= 3 && a[i + 1
 
] >= 3) {
            a[i] -= 3, a[i + 1] -= 3;
            flag = 1;
            sum = min(work() + 1,sum);
            int j;
            for(j = i + 2; j <= 14; j++) {
                if(a[j] < 3) break;
                a[j] -= 3;
                sum = min(work() + 1, sum);
            }
            for(int k = i; k < j; k++) {
                a[k] += 3;
            }
        }
    }

    //2 shun 
    for(int i = 3; i <= 12; i++) {
        if(a[i] >= 2 && a[i + 1] >= 2 && a[i + 2] >= 2) {
            a[i] -= 2, a[i + 1] -= 2, a[i + 2] -= 2;
            flag = 1;
            sum = min(work() + 1,sum);
            int j;
            for(j = i + 3; j <= 14; j++) {
                if(a[j] < 2) break;
                a[j] -= 2;
                sum = min(work() + 1, sum);
            }
            for(int k = i; k < j; k++) {
                a[k] += 2;
            }
        }
    }
    //1 shun
    for(int i = 3; i <= 10; i++) {
        if(a[i] >= 1 && a[i + 1] >= 1 && a[i + 2] >= 1 && a[i + 3] >= 1 && a[i + 4] >= 1) {
            a[i] -= 1, a[i + 1] -= 1, a[i + 2] -= 1,a[i + 3] -= 1 , a[i + 4] -= 1;
            flag = 1;
            sum = min(work() + 1,sum);
            int j;
            for(j = i + 5; j <= 14; j++) {
                if(a[j] < 1) break;
                a[j] -= 1;
                sum = min(work() + 1, sum);
            }
            for(int k = i; k < j; k++) {
                a[k] += 1;
            }
        }
    }

    //4 + 2
    for(int i = 3; i < 16; i++) {
        if(a[i] == 4) {
            a[i] -= 4;
            flag = 1;
            sum = min(sum, work() + 1);
            for(int j = 3; j < 16; j++) {//dui
                if(a[j] >= 2) {
                    a[j] -= 2;
                    for(int k = 3; k < 16; k++) {
                        if(a[k] >= 2) {
                            a[k] -= 2;
                            sum = min(sum, work() + 1);
                            a[k] += 2;
                        }
                    }
                    a[j] += 2;
                }
            }
            for(int j = 3; j <= 16; j++) {//dan
                if(a[j] >= 1) {
                    a[j] -= 1;
                    for(int k = 3; k <= 16; k++) {
                        if(a[k] >= 1) {
                            a[k] -= 1;
                            sum = min(sum, work() + 1);
                            a[k] += 1;
                        }
                    }
                    a[j] += 1;
                }
            }
            a[i] += 4;
        }
    }
    //3 + 1
    for(int i = 3; i < 16; i++) {
        if(a[i] >= 3) {
            a[i] -= 3;
            flag = 1;
            sum = min(sum, work() + 1);
            for(int j = 3; j <= 16; j++) {//dui
                if(a[j] >= 2) {
                    a[j] -= 2;
                    sum = min(sum, work() + 1);
                    a[j] += 2;
                }
            }
            for(int j = 3; j <= 16; j++) {//dan
                if(a[j] >= 1) {
                    a[j] -= 1;
                    sum = min(sum, work() + 1);
                    a[j] += 1;
                }
            }
            a[i] += 3;
        }
    }
    //dui
    for(int i = 3; i <= 16; i++) {
        if(a[i] >= 2) {
            a[i] -= 2;
            flag = 1;
            sum = min(sum, work() + 1);
            a[i] += 2;
        }
    }
    //dan
    if(!flag){
        sum = 0;
        for(int i = 3; i <= 16; i++) {
            sum += a[i];
        }
    }
    q[zp] = sum;
    return sum;
}

int main() {
    T = read(), n = read();
    while(T--) {
        memset(a,0,sizeof(a));
        for(int i = 1; i <= n; i++) {
            int p = read(), q = read();
            if(p == 0) a[16]++;
            else if(p == 1) a[14]++;
            else if(p == 2) a[15]++;
            else a[p]++;
        }
        printf("%d\n",work());
    }
    return 0;
}