#include <bits/stdc++.h>
using namespace std;

ifstream f("cuplaj.in");
ofstream g("cuplaj.out");

int n,m,e;
int x,y;
int l[10005],r[10005];
bool ok=1,viz[10005];
vector < int > v[10005];
int ctr;

void read() {
    f >> n >> m >> e;
    for (int i=1;i<=e;i++) {
        f >> x >> y;
        v[x].push_back(y);
    }
}

bool dfs(int nod) {
    viz[nod]=1;
    for (auto k:v[nod]) {
        if (!r[k] || (!viz[r[k]] && dfs(r[k]))) {
            l[nod] = k;
            r[k] = nod;
            return 1;
        }
    }
    return 0;
}

void solve() {
    while (ok) {
        ok=0;
        fill(viz+1,viz+n+1,0);
        for (int i=1;i<=n;i++) {
            if (!l[i] && dfs(i)) {
                ctr++;
                ok=1;
            }
        }
    }
}

void show() {
    g << ctr << '\n';
    for (int i=1;i<=n;i++) {
        if (l[i]) {
            g << i << " " << l[i] << '\n';
        }
    }
}

int main()
{
    read();
    solve();
    show();
    return 0;
}