#include <stdio.h>

#define DIM 1005
#define INF 1<<31-1

struct nod {int x;
            nod *urm;} *lst[DIM];
int c[DIM][DIM],f[DIM][DIM];
int q[DIM],t[DIM];
int n,m,e,minim,cuplaj;

void add (int a,int b)
{
    nod *p=new nod;

    p->x=a;
    p->urm=lst[b];
    lst[b]=p;
}

void read ()
{
    freopen ("cuplaj.in","r",stdin);
    int i,x,y;

    scanf ("%d%d%d",&n,&m,&e);
    for (i=1; i<=e; ++i)
    {
        scanf ("%d%d",&x,&y);
        add (0,x);
        add (x,0);
        add (y,n+m+1);
        add (x+m+1,y);
        add (x,y+n);
        add (y+n,x);
        c[x][y+n]=1;
        c[0][x]=INF;
        c[y][n+m+1]=INF;
    }
}

int bf ()
{
    nod *p;
    int st,dr,i;

    for (i=1; i<=n; ++i)
        t[i]=0;
    for (q[st=dr=1]=0; st<=dr; ++st)
        for (p=lst[q[st]]; p; p=p->urm)
            if (!t[p->x] && c[q[st]][p->x]>f[q[st]][p->x])
            {
                t[p->x]=q[st];
                q[++dr]=p->x;
            }
    return t[n];
}

int min (int a,int b)
{
    if (a<b)
        return a;
    return b;
}

void solve ()
{
    int i,j;

    for ( ; bf (); )
		for (i=1; i<=n; ++i)
		    if (t[i]>0 && c[i][n+m+1]-f[i][n+m+1]>0)
		    {
				minim=c[i][n+m+1]-f[i][n+m+1];
    			for (j=i; j!=1; j=t[j])
    				minim=min (minim,c[t[j]][j]-f[t[j]][j]);
                f[i][n+m+1]+=minim;
                f[n+m+1][i]-=minim;
    			for (j=i; j!=1; j=t[j])
                {
                    f[t[j]][j]+=minim;
                    f[j][t[j]]-=minim;
                }
                ++cuplaj;
        	}
}

void print ()
{
    freopen ("cuplaj.out","w",stdout);
    printf ("%d",cuplaj);
}

int main ()
{
    read ();
    solve ();
    print ();

    return 0;
}