#include<iostream>using namespace std;#define MAXV 130int n,m;//交叉路口和街道的个数int map[MAXV][MAXV];int link[MAXV],use[MAXV];bool dfs(int x){int i,j;for(i=1;i<=n;i++){if(map[x][i] && !use[i] ){//拆点注意i不能等于x，否则就自己和自己匹配了j=link[i];use[i]=1;link[i]=x;if(j==-1 || dfs(j)) return true;link[i]=j;}}return false;}int hungary(){int num=0;int i;memset(link,-1,sizeof(link));for(i=1;i<=n;i++){memset(use,0,sizeof(use));if(dfs(i)) num++;}return n-num;}int main(){int Case;int a,b,i;scanf("%d",&Case);while(Case--){scanf("%d%d",&n,&m);memset(map,0,sizeof(map));for(i=0;i<m;i++){scanf("%d%d",&a,&b);map[a][b]=1;}printf("%dn",hungary());}return 0;}
