#include<bits/stdc++.h>
using namespace std;

int n,m,e;
const int maxN=(2e4)+5;
vector<int> v[maxN];
int x,y;

bool seen[maxN];
int l[maxN],r[maxN];

inline int path(int nod)
{
    if(seen[nod]) return 0;
    seen[nod]=1;

    for(auto it:v[nod])
        if(!r[it])
    {
        r[it]=nod;
        l[nod]=it;
        return 1;
    }

    for(auto it:v[nod])
        if(path(r[it]))
    {
        r[it]=nod;
        l[nod]=it;
        return 1;
    }

    return 0;
}

int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);

    scanf("%d%d%d",&n,&m,&e);

    for(int i=1;i<=e;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(n+y);
        v[n+y].push_back(x);
    }

    int augment=1;

    while(augment)
    {
        memset(seen,0,sizeof(seen));
        augment=0;
        for(int i=1;i<=n;i++)
            if(!l[i]) augment|=path(i);
    }
    int cuplaj=0;

    for(int i=1;i<=n;i++)
        if(l[i]) cuplaj++;


    printf("%d\n",cuplaj);

    for(int i=1;i<=n;i++)
        if(l[i]) printf("%d %d\n",i,l[i]-n);


    return 0;
}