#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
using LL = long long;
const int N = 1e5 + 10;
int idx, n1, n2, m, e[N], ne[N], h[N], ans, st[N], f[N];
void add (int a, int b) { e[idx]=b,ne[idx]=h[a],h[a]=idx++; }
bool dfs (int u) {
for(int i = h[u]; ~i; i = ne[i]) {
int v = e[i];
if(!st[v]) {
st[v] = 1;
if(!f[v] || dfs(f[v])) {
f[v] = u;
return true;
}
}
}
return false;
}
int main (void) {
memset(h, -1, sizeof h);
scanf("%d%d%d", &n1, &n2, &m);
for(int i = 0; i < m; i++) {
int a, b; scanf("%d%d", &a, &b); add(a, b);
}
for(int i = 1; i <= n1; i++) {
memset(st, false, sizeof st);
if(dfs(i)) ans++;
}
printf("%d", ans);
return 0;
}