#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
vector <int> v[10003];
queue <int> q;
int n, f[10003][10003], c[10003][10003], viz[10003], s, d, flow, fmini;
int t[10003], e;

int bfs(){
    int i, fiu;
    while (!q.empty())
        q.pop();
    for (i = 1; i <= n; i++)
        viz[i] = 0;
    viz[s] = 1; q.push(s);
    while (!q.empty()){
        int nod = q.front(); q.pop();
        for (i = 0; i < v[nod].size(); i++){
            fiu = v[nod][i];
            if (viz[fiu] == 0 and c[nod][fiu] != f[nod][fiu]){
                viz[fiu] = 1;
                t[fiu] = nod;
                q.push(fiu);
                if (fiu == d)
                    return 1;
            }
        }
    }
    return 0;
}

void flux(){
    int nod;
    flow = 0;
    while (bfs()){
        fmini = 9999999;
        nod = d;
        while (nod != s){
            fmini = min(fmini, c[t[nod]][nod] - f[t[nod]][nod]);
            nod = t[nod];
        }
        nod = d;
        while (nod != s){
            f[t[nod]][nod] += fmini;
            f[nod][t[nod]] -= fmini;
            nod = t[nod];
        }
        flow += fmini;
    }
    fout << flow << '\n';
}

void citire(){ // e buna
    int i, a, b, st, dr;
    fin >> st >> dr >> e;
    n = st + dr + 2;
    for (i = 1; i <= e; i++){
        fin >> a >> b;
        v[a].push_back(b + st);
        c[a][b + st] = 1;
    }
     //construim reteaua de transport
    s = n - 1; d = n;
    for (i = 1; i <= st; i++){ // s -> fiecare nod din st
        v[s].push_back(i);
        c[s][i] = 1;
    }
    for (i = 1; i <= dr; i++){ // fiecare nod din dr -> d
        v[i + st].push_back(d);
        c[i + st][d] = 1;
    }
}

int main(){
    citire();
    flux();
    /*for (int i = 1; i <= n + 2; i++){
        for (int j = 1; j <= n + 2; j++){
            if (c[i][j] == 1)
                fout << i << " " << j << '\n';
        }
    }*/
   // fout << s << " " << d; mai lucreaza la flux
}