#include <bits/stdc++.h>
using namespace std;

int T, n;
int wang, da;
int cnt[20];

int solve() {
    int score = 0;
    for (int i = 2; i <= 14; i++) {
        if (cnt[i] == 4) score += 2;
        else if (cnt[i] == 3) score += 2;
        else if (cnt[i] == 2) score += 1;
        else if (cnt[i] == 1) score += 1;
    }
    if (wang + da > 0) score += 1;
    return max(1, min(score, 30));
}

int main() {
    cin >> T >> n;
    while (T--) {
        memset(cnt, 0, sizeof(cnt));
        wang = da = 0;
        for (int i = 1; i <= n; i++) {
            int a, b;
            cin >> a >> b;
            if (a == 0) b == 1 ? wang++ : da++;
            else if (a == 1) cnt[14]++;
            else cnt[a]++;
        }
        cout << solve() << endl;
    }
    return 0;
}