#include <cstdio>
#include <vector>
#include <cstring>
#define pb push_back
using namespace std;
int i,m,n,k,st[100010],dr[100010],nr,x,y;
bool U[100010],ok;

vector <int> G[100010];
inline bool cupleaza(int nod)
{
    int i;
    bool ok;
    if (U[nod]==true) return 0;
    U[nod]=true;
    for (i=1; i<=m; i++)
    {
        ok=false;
        for (int j=0; j<G[nod].size(); j++)
            if (G[nod][j]==i) {ok=true; break;}
        if (ok==true)
        {
            if (!dr[i] || cupleaza(dr[i]))
            {
                st[nod]=i;
                dr[i]=nod;
                return 1;
            }
        }
        else continue;
    }
    return 0;
}
inline void cuplaj()
{
    int i;
    for (i=1; i<=n; i++)
    {
        if (st[i]) continue;
        if (cupleaza(i)) nr++;
        else
        {
            memset(U,false,sizeof(U));
            if (cupleaza(i)) nr++;
        }
    }
}
int main()
{
    int i;
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    scanf("%d %d %d\n",&n,&m,&k);
    for (i=1; i<=k; i++)
    {
        scanf("%d %d\n",&x,&y);
        G[x].pb(y);
    }
    cuplaj();
    printf("%d\n",nr);
    for (i=1; i<=n; i++)
         if (st[i])
             printf("%d %d\n",i,st[i]);
    return 0;
}