/// [A][M][C][B][N] ///
#include <bits/stdc++.h>
#include <random>
const char nl = '\n';
const char sp = ' ';
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");

const int nmax = 1e4;
int n, m, t;
vector<int> g[nmax + 1];
int p[nmax + 1]{0}; // size m
// nodul pereche din multimea L
int q[nmax + 1]{0}; // size n
// nodul pereche din multimea R
bool used[nmax + 1]{0}; // size n
// vector de booluri pt dfs

bool dfs(int v) {
    used[v] = 1;
    for (int& u : g[v]) {
        if (!p[u] || (!used[p[u]] && dfs(p[u]))) {
            p[u] = v, q[v] = u;
            return 1;
        }
    }
    return 0;
}

int order[nmax + 1]{0};
void initMatching() {
    iota(order + 1, order + n + 1, 1);
    random_shuffle(order + 1, order + n + 1);
    for (int i = 1; i <= n; ++i) {
        for (int& u : g[order[i]]) {
            if (!p[u]) {
                p[u] = order[i];
                q[order[i]] = u;
                break;
            }
        }
    }
}

int main() {
    srand(time(NULL));
    ios::sync_with_stdio(0);
    cin.tie(0);
    fin >> n >> m >> t;
    while (t--) {
        int v, u;
        fin >> v >> u;
        g[v].push_back(u);
    }
    initMatching();
    int cnt = 0, ok = 1;
    while (ok) {
        ok = 0;
        memset(used, 0, (n + 1) * sizeof(bool));
        for (int v = 1; v <= n; ++v) {
            if (!q[v] && dfs(v)) {
                cnt++;
                ok = 1;
            }
        }
    }
    fout << cnt << nl;
    for (int i = 1; i <= n; ++i) {
        if (q[i]) {
            fout << i << sp << q[i] << nl;
        }
    }
}