pku1422

/*
 * File:   pku1422.cpp
 * Author: chenjiang
 *最小路径覆盖=顶点数-最大匹配数
 * 最大匹配：匈牙利算法
 * Created on 2010年4月11日, 下午1:57
 */

#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define Max_V 125
int pre[Max_V], mapmap[Max_V][Max_V], n, m, my[Max_V];
bool visited[Max_V];

bool find(int x) {
    int i;
    for (i = 1; i <= n; i++) {
        if (!visited[i] && mapmap[x][i]) {
            visited[i] = 1;
            if (my[i] == -1 || find(my[i])) {
                my[i] = x;
                return 1;
            }
        }
    }
    return 0;
}

int MMG() {
    int i, j;
    int ans = 0;
    memset(my, -1, sizeof (my));
    for (i = 1; i <= n; i++) {
        memset(visited, 0, sizeof (visited));
        if (find(i))ans++;
    }
    return ans;
}

/*
 *
 */
int main(int argc, char** argv) {

    int i, j, e, s;
    int ca;
    //freopen("a.in","r",stdin);
    cin >> ca;
    while (ca--) {
        cin >> n >> m;
        memset(mapmap, 0, sizeof (mapmap));
        for (i = 1; i <= m; i++) {
            cin >> s >> e;
            mapmap[s][e] = 1;
        }
        int ans = MMG();
        cout << n - ans << endl;
    }
    return (EXIT_SUCCESS);
}