#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int l[10005], r[10005];
int s[10005];
vector<int> v[10005];

int e, g, m;
int i, j, k, rez;
int DFM(int nod);

int main()
{
    freopen("cuplaj.in", "r", stdin);
    freopen("cuplaj.out", "w", stdout);
    scanf("%d %d %d", &e, &g, &m);
    
    for ( k = 1; k <= m; k++ )
        scanf("%d %d", &i, &j),
        v[i].push_back(j);
    k = 0;
    for (int change = 1; change; )
    {
        change = 0;
        k++;
        for ( i = 1; i <= e; i++ )
            if ( r[i] == 0 ) 
                change |= DFM(i);
    }
    for (i = 1; i <= e; i++ ) rez += (r[i] > 0);
    printf("%d\n", rez);
    for ( i = 1; i <= e; i++ )
        if ( r[i] != 0 )
           printf("%d %d\n", i, r[i]);
    return 0;
}

int DFM(int nod)
{
    if ( s[nod] == k ) return 0;
    s[nod] = k;
    vector<int>::iterator it;
    for ( it = v[nod].begin(); it != v[nod].end(); it++ )
        if ( l[*it] == 0 )
        {
             l[*it] = nod;
             r[nod] = *it;
             return 1;
        }
    for ( it = v[nod].begin(); it != v[nod].end(); it++ )
        if ( DFM(l[*it]) )
        {
             l[*it] = nod;
             r[nod] = *it;
             return 1;
        }
    return 0;
}