/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)3e4 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n, m, k;
vector <int> g[N];
int p[N];
bool was[N];
int dfs(int v, int R) {
if (was[v]) return 0;
was[v] = 1;
for (auto to : g[v]) {
if (!(to <= R)) continue;
if (p[to] == -1 || dfs(p[to], R)) {
p[to] = v;
return 1;
}
}
return 0;
}
int ok(int R) {
R += m;
memset(p, -1, sizeof(p));
for (int i = 1; i <= m; i++) {
memset(was, 0, sizeof(was));
dfs(i, R);
}
int cnt = 0, last = -1;
for (int i = m + 1; i <= n + m; i++) {
cnt += p[i] != -1;
if (p[i] != -1 && last == -1) last = i;
cerr << p[i] << ' ';
}
cerr << nl;
if (cnt == m) return last - (m + 1) + 1;
return 0;
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> n >> m >> k;
for (int i = 1; i <= k; i++) {
int a, b;
cin >> b >> a;
g[a].pb(b + m);
}
for (int i = 1; i <= m; i++) {
//sort(all(g[i]));
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += ok(i);
}
cout << ans;
ioi
}
