#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, M = 4e5 + 5;
struct Edge {
	int t, n, w;
} e[M << 1];
int tot = 1, n, s, t, h[N], cur[N], dis[N], que[N];
inline void add(int u, int v, int w) { e[++tot] = (Edge){v, h[u], w}, h[u] = tot; }
inline void eadd(int u, int v, int w) { add(u, v, w), add(v, u, 0); }
int bfs() {
	memset(dis, 0x3f, sizeof(dis)), dis[que[1] = t] = 0;
	for (int i = 1, sz = 1; i <= sz; ++i)
		for (int j = h[que[i]]; j; j = e[j].n)
			if (e[j ^ 1].w && dis[e[j].t] > n)
				dis[que[++sz] = e[j].t] = dis[que[i]] + 1;
	if (dis[s] > n) return 0;
	memcpy(cur, h, sizeof(h));
	return 1;
}
int dfs(int u, int lim) {
	if (u == t) return lim;
	int sum = 0;
	for (int &i = cur[u]; i; i = e[i].n)
		if (e[i].w && dis[u] - 1 == dis[e[i].t]) {
			int ret = dfs(e[i].t, min(lim, e[i].w));
			e[i].w -= ret, e[i ^ 1].w += ret, sum += ret;
			if (!(lim -= ret)) return sum;
		}
	return sum;
}

int main() {
	int n1, n2, m, ans = 0;
	scanf("%d%d%d", &n1, &n2, &m), n = n1 + n2 + 2, s = n - 1, t = n;
	for (int i = 1, u, v; i <= m; ++i) scanf("%d%d", &u, &v), ++u, ++v, v += n1, eadd(u, v, 1);
	for (int i = 1; i <= n1; ++i) eadd(s, i, 1);
	for (int i = 1; i <= n2; ++i) eadd(i + n1, t, 1);
	while (bfs()) ans += dfs(s, n);
	printf("%d\n", ans);
	return 0;
}