#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
const int NMax = 10000;
vector <int> G[NMax+5];

int L[NMax+5], R[NMax+5], N, M, E, Use[NMax+5];

void Read() {
    in >> N >> M >> E;
    for (int i = 1; i <= E; i++) {
        int x, y;
        in >> x >> y;
        G[x].push_back(y);
    }
}

int Pairup(int Nod) {
    if(Use[Nod]) return 0;
    Use[Nod] = 1;
    for (auto Vecin : G[Nod]) {
        if(!R[Vecin]) {
            L[Nod] = Vecin;
            R[Vecin] = Nod;
            return 1;
        }
    }
    for (auto Vecin : G[Nod]) {
        if(Pairup(R[Vecin])) {
            L[Nod] = Vecin;
            R[Vecin] = Nod;
            return 1;
        }
    }
    return 0;
}

void Solve() {
    for (int i = 1; i <= N; i++) {
        memset(Use,0,sizeof(Use));
        Pairup(i);
    }
}

void Print() {
    int Sol = 0;
    for (int i = 1; i <= N; i++)
        if(L[i]) Sol++;
    out << Sol << '\n';
    for (int i = 1; i <= N; i++)
        if(L[i])
            out << i << " " << L[i] << '\n';
}

int main() {
    Read();
    Solve();
    Print();
}