#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
vector <int> G[20005];
int U[20005],st[20005],dr[20005];
int n,m,e,i,nr,x,y;
int cupleaza(int nod)
{
    int i;
    if (U[nod]) return 0;
    U[nod]=1;
    for (i=0; i<G[nod].size(); i++)
    {
        if (!dr[G[nod][i]] || cupleaza(dr[G[nod][i]]))
        {
            st[nod]=G[nod][i];
            dr[G[nod][i]]=nod;
            return 1;
        }
    }
    return 0;
}
void cuplaj()
{
    int i;
    for (i=1; i<=n; i++)
    {
        if (st[i]) continue;
        if (cupleaza(i)) nr++;
        else
        {
            memset(U,0,sizeof(U));
            if (cupleaza(i)) nr++;
        }
    }
}
int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    scanf("%d %d %d",&n,&m,&e);
    nr=0;
    for (i=1; i<=e; i++)
    {
        scanf("%d %d",&x,&y);
        G[x].push_back(y+n);
        G[y+n].push_back(x);
    }
    cuplaj();
    printf("%d\n",nr);
    for (i=1; i<=n; i++) if (st[i]!=0) printf("%d %d\n",i,st[i]-n);
    return 0;
}