#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
int n,m,e,x,y,i,k;
int viz[10001],L[10001],R[10001];
vector<int>v[10001];
int cupleaza(int s)
{
    int i;
    viz[s]=1;
    for (i=0;i<v[s].size();++i)
    {
        int nod=v[s][i];
        if (R[nod]==0)
        {
            L[s]=nod;
            R[nod]=s;
            return 1;
        }
    }
    for (i=0;i<v[s].size();++i)
    {
        int nod=v[s][i];
        if (viz[R[nod]]==0 && cupleaza(R[nod]))
        {
            L[s]=nod;
            R[nod]=s;
            return 1;
        }
    }
    return 0;
}
int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    scanf("%d%d%d",&n,&m,&e);
    for (i=1;i<=e;++i)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    int ok=0;
    do
    {
        ok=0;
        memset(viz,0,sizeof(viz));
        for (i=1;i<=n;++i)
            if (L[i]==0 && cupleaza(i)) ok=1;
    }while (ok==1);
    for (i=1;i<=n;++i)
        if (L[i]!=0) ++k;
    printf("%d\n",k);
    for (i=1;i<=n;++i)
        if (L[i]!=0) printf("%d %d\n",i,L[i]);
    return 0;
}