#include<stdio.h>
#include<algorithm>
#include<vector>
#define Nmx 10005

using namespace std;

vector < int > G[Nmx];

int l[Nmx],r[Nmx],n,m,T,viz[Nmx];


void citire()
{
    int x,y;
    scanf("%d%d%d",&n,&m,&T);
    for(int i=1;i<=T;++i)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
}

int pairup(int nod)
{
    if(viz[nod])
       return 0;
    viz[nod]=1;
    for(int i=0;i<G[nod].size();++i)
        if(!r[G[nod][i]])
        {
            r[G[nod][i]]=nod;
            l[nod]=G[nod][i];
            return 1;
        }
    for(int i=0;i<G[nod].size();++i)
        if(pairup(r[G[nod][i]]))
        {
            r[G[nod][i]]=nod;
            l[nod]=G[nod][i];
            return 1;
        }
    return 0;

}

void solve()
{
    int ok,cuplaj=0;
    do{
        ok=0;
        memset(viz,0,sizeof(viz));
        for(int i=1;i<=n;++i)
            if(!l[i] && pairup(i))
            {
                cuplaj++;
                ok=1;
            }
    }
    while(ok);
    printf("%d\n",cuplaj);
    for(int i=1;i<=n;++i)
        if(l[i]!=0)
            printf("%d %d\n",i,l[i]);
    printf("\n");
}

int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    citire();
    solve();
    return 0;
}