#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
using namespace std;
const int N = 2e5 + 7, inf = 1e9;
int n, m, q;
ll ans;

vi e[N];
int matl[N], matr[N], disl[N], disr[N];
bool bfs() {
	L(i, 1, n) 
		disl[i] = inf, disr[i] = inf;
	queue < int > q;
	L(i, 1, n)
	 	if(!matl[i]) 
	 		disl[i] = 0, q.push(i);
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		for(auto&v : e[u]) 
			if(disr[v] > disl[u] + 1) {
				disr[v] = disl[u] + 1;
				if(matr[v]) 
					disl[matr[v]] = disr[v], q.push(matr[v]);
			}
	}
	L(i, 1, n) 
		if(!matr[i] && disr[i] < inf)
			return true;
	return false;
}

int visr[N], visl[N];
int dfs(int x, int mnd) {
	if(disl[x] >= mnd) 
		return false;
	if(visl[x]) 
		return false;
	visl[x] = true;
	for(auto&v : e[x]) {
//		cout << x << " -> " << v << ' ' << disr[v] << ' ' << visr[v] << endl;
		if(disr[v] == disl[x] + 1 && !visr[v]) {
//			cout << x << " -> " << v << ' ' << matr[v] << endl;
			visr[v] = true;
			if(!matr[v] || dfs(matr[v], mnd)) {
				matr[v] = x, 
				matl[x] = v;
				return true;
			}
		}
	}
	return false;
}

int stk[N], top;
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> q;
	
	int ans = 0;
	while(q--) {
		int m;
		cin >> m;
		while(m--) {
			int x, y;
			cin >> x >> y;
			e[x].emplace_back(y);
		}
		while(bfs()) {
			L(i, 1, n) visl[i] = false, visr[i] = false;
			int mn = inf;
			L(i, 1, n) if(!matr[i]) mn = min(mn, disr[i]);
			L(x, 1, n) 
				if(!matl[x] && disl[x] == 0 && dfs(x, mn)) {
					++ans;
					break;
				}
//			cout << endl;
//			L(i, 1, n) {
//				cout << matl[i] << ' ' << matr[i] << endl;
//			}
		}
		L(u, 1, n) if(disl[u] == inf) {
			top = 0;
			L(p, 0, sz(e[u]) - 1) {
				int v = e[u][p];
				if(disr[v] < inf) {
					stk[++top] = p;
				}
			}
			R(i, top, 1) {
				e[u].erase(e[u].begin() + stk[i]);
			}
		}
		cout << ans << ' ';
	}
	return 0;
} 
/*
3 2
1
1 1
2
2 1
1 2
*/