#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;

#define Nmax 10010
#define pb push_back
#define IT vector<int> :: iterator

int N, M, L[Nmax], R[Nmax], Used[Nmax], X, Y, E;
vector<int> G[Nmax];

int PairUp(int Node)
{
    if(Used[Node]) return 0;
    Used[Node] = 1;
    for(IT it = G[Node].begin(); it != G[Node].end(); ++it)
        if(!R[*it] || PairUp(R[*it]))
        {
            R[*it] = Node;
            L[Node] = *it;
            return 1;
        }
    return 0;
}

int MaxMatching()
{
    int Ans = 0, OK = 1;
    while(OK)
    {
        OK = 0;
        for(int i = 1; i <= N; ++ i) Used[i] = 0;
        for(int i = 1; i <= N; ++ i)
            if(!L[i] && PairUp(i))
                Ans ++, OK = 1;
    }
    return Ans;
}

int main()
{
    freopen("cuplaj.in", "r", stdin);
    freopen("cuplaj.out", "w", stdout);
    int i;
    scanf("%i %i %i", &N, &M, &E);
    for(i = 1; i <= E; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].pb(Y);
    }
    printf("%i\n", MaxMatching());
    for(i = 1; i <= N; ++ i)
        if(L[i])
            printf("%i %i\n", i, L[i]);
    return 0;
}