#include <bits/stdc++.h>
#define N 10000
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");

int n,m,k,i,C,R[N],L[N],x,y,O=-1,t=1;
vector<int> v[N];
bitset<N> T;
bool P(const int n)
{
if (T[n])return 0;
T[n]=1;
for (const auto j:v[n])
if (!L[j]||P(L[j])){
    L[j]=n,R[n]=j;
    return 1;
}
return 0;
}

int main()
{
f>>n>>m>>k;
for (i=1;i<=k;++i)
    f>>x>>y,v[x].push_back(y);
for(i=1;i<=n;++i)
    if (!R[i]&&P(i))++C,T=0;
g<<C<<'\n';
for (i=1;i<=n;++i)
    if (R[i])g<<i<<" "<<R[i]<<'\n';

    return 0;
}