using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#define nmax 1005
#define pb push_back
#define oo 0x3f3f3f3f
vector<int> G[nmax];
int C[nmax][nmax];
int F[nmax][nmax];
int D,S,M,N;
int ante[nmax];
int q[nmax];
int viz[nmax];
ofstream fout("cuplaj.out");

bool BFS()
{
    memset(q,0,sizeof(q));
    memset(viz,0,sizeof(viz));
    memset(ante,0,sizeof(ante));
    q[++q[0]]=1;
    viz[1]=1;
    int front=1,u;
    vector<int>::iterator it;

    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();it++)
        {
            if(!viz[*it] && C[u][*it]>F[u][*it])
            {
                ante[*it]=u;
                viz[*it]=1;
                q[++q[0]]=*it;
            }
        }
    }


    return viz[N];


}

void solve()
{int flow,i,fmin;
vector<int>::iterator it;
    for(flow=0;BFS();)
    {
        fmin=oo;
        for(it=G[N].begin();it<G[N].end();it++)
        if(viz[*it])
        {
            fmin=C[*it][N]-F[*it][N];
            for(i=*it;i>1;i=ante[i])
            {
                fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);

            }

            F[*it][N]+=fmin;
            F[N][*it]-=fmin;

            for(i=*it;i>1;i=ante[i])
            {
                F[ante[i]][i]+=fmin;
                F[i][ante[i]]-=fmin;
            }

            flow+=fmin;

        }
    }
    fout<<flow<<"\n";

}

void cit()
{int i,x,y;
    ifstream fin("cuplaj.in");
    fin>>S>>D>>M;
    N=S+D+2;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y;
        G[1+x].pb(1+S+y);
        G[1+S+y].pb(1+x);
        //cout<<1+x<<" "<<1+S+y<<"\n";
        C[1+x][1+S+y]+=1;
        C[1+S+y][1+x]+=1;

    }

    for(i=1;i<=S;i++)

        G[1].pb(1+i),G[i+1].pb(1),C[1][1+i]=10000;
    for(i=1;i<=D;i++)
        G[1+S+i].pb(N),G[N].pb(1+i+S),C[1+S+i][N]=10000;

    fin.close();

}

int main()
{
    cit();

    solve();

    fout.close();
    return 0;
}