# include <iostream>
# include <fstream>
# include <vector>
# include <queue>
# include <string.h>
# include <algorithm>
# define nmax 10003
using namespace std;

int n,m, c[nmax][nmax], f[nmax][nmax], p[nmax], viz[nmax];
vector <int> a[nmax];

ifstream fin("cuplaj.in");
ofstream g("cuplaj.out");

int bf()
{
    memset(viz, 0, sizeof(viz));
    int i,nod,k;
    queue <int> q;
    q.push(0);
    viz[0]=1;

    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0; i<a[nod].size(); i++)
        {
            k=a[nod][i];
            if(!viz[k] && c[nod][k]>f[nod][k])
            {
                p[k]=nod;
                q.push(k);
                viz[k]=1;
                if(k==n+m+1)
                    return 1;
            }
        }
    }

    return 0;
}

void tip()
{
    int i,j;
    for(i=0; i<=n+m+1; i++)
    {
        cout<<i<<"    ";
        for(j=0; j<a[i].size(); j++)
            cout<<a[i][j]<<" ";
        cout<<endl;
    }
}

int main()
{
    int i, c_m,x,y;
    fin>>n>>m>>c_m;

    for(i=1; i<=n; i++)
    {
        a[0].push_back(i);
        c[0][i]=1;
    }

    for(i=n+1; i<n+m+1; i++)
    {
        a[i].push_back(n+m+1);
        c[i][n+m+1]=1;
    }

    for(i=1; i<=c_m; i++)
    {
        fin>>x>>y;
        a[x].push_back(y+m+1);
        a[y+m+1].push_back(x);
        c[x][y+m+1]=1;
    }

    int nod,fmin=99, mfl=0;
    //tip();
    while(bf())
    {
        for(nod=n+m+1; nod!=0; nod=p[nod])
            fmin=min(fmin, c[p[nod]][nod]-f[p[nod]][nod]);

        for(nod=n+m+1; nod!=0; nod=p[nod])
        {
            if(p[nod]!=0 && nod!=n+m+1 && f[p[nod]][nod]>0)
                cout<<p[nod]<<" "<<nod-m-1<<endl;
            f[p[nod]][nod]+=fmin;
            f[nod][p[nod]]-=fmin;
        }
        mfl+=fmin;
    }


    g<<mfl;

    return 0;
}