#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(const auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll,ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

class BM {
private:
    const int U, V;
    vector<vector<int> > G;
    vector<int> level, que, ralloc;
public:
    BM(const int u, const int v)
         : U(u), V(v), G(U + V), level(U + V), que(U + V), ralloc(V, -1), alloc(U, -1){}
    void add_edge(const int from, const int to){
        G[from].push_back(U + to);
    }
    bool bfs(){
        bool res = false;
        fill(level.begin(), level.end(), -1);
        int qh = 0, qt = 0;
        for(int i = 0; i < U; ++i){
            if(alloc[i] < 0) level[i] = 0, que[qt++] = i;
        }
        while(qh < qt){
            const int u = que[qh++];
            if(u >= U){
                const int v = ralloc[u - U];
                if(v >= 0){
                    level[v] = level[u] + 1, que[qt++] = v;
                }else{
                    res |= true;
                }
            }else{
                for(const int v : G[u]){
                    if(level[v] < 0){
                        level[v] = level[u] + 1, que[qt++] = v;
                    }
                }
            }
        }
        return res;
    }
    bool dfs(const int u){
        const int tmp = level[u];
        level[u] = -1;
        if(u >= U){
            if(ralloc[u - U] < 0) return true;
            else return dfs(ralloc[u - U]);
        }else{
            for(const int v : G[u]){
                if(tmp < level[v]){
                    if(dfs(v)){
                        alloc[u] = v - U, ralloc[v - U] = u;
                        return true;
                    }
                }
            }
        }
        return false;
    }
    // alloc に左側頂点がどの右側頂点とマッチングされるかが格納される
    vector<int> alloc;
    int solve(){
        int flow = 0;
        for(;;){
            if(!bfs()) break;
            for(int i = 0; i < U; ++i){
                if(alloc[i] < 0) flow += dfs(i);
            }
        }
        return flow;
    }
    // solve() を呼び出した後に呼び出す(左側頂点 i の添字は U(右側頂点数) + i とする)
    vector<int> minimum_vertex_cover(){
        vector<int> mvc;
        for(int i = 0; i < U; ++i){
            if(level[i] < 0) mvc.push_back(i);
        }
        for(int i = U; i < U + V; ++i){
            if(level[i] >= 0) mvc.push_back(i);
        }
        return mvc;
    }
};

#define getchar getchar_unlocked
#define putchar putchar_unlocked

inline int in() {
    int n = 0; short c;
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}

inline void out(int n) {
    short res[10], i = 0;
    do { res[i++] = n % 10, n /= 10; } while (n);
    while (i) putchar(res[--i] + '0');
}

int main()
{
    int L, R, m, u, v;
    L = in(), R = in(), m = in();
    BM bm(L, R);
    rep(i,m){
        u = in(), v = in();
        bm.add_edge(u, v);
    }
    const int res = bm.solve();
    out(res);
    putchar('\n');
    const auto& ch = bm.minimum_vertex_cover();
    assert(res == (int)ch.size());
    // rep(i,L){
    //     if(bm.alloc[i] >= 0){
    //         out(i), putchar(' '), out(bm.alloc[i]), putchar('\n');
    //     }
    // }
    return 0;
}


Measured memory_bytes: 3200