#include <bits/stdc++.h>

using namespace std;
#ifndef HOME
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
#else
ifstream fin("ciorna.in");
ofstream fout("ciorna.out");
#endif
class Matcher {
    int n, m;
    vector <int> l, r;
    vector <bool> upd;
    vector <vector <int>> g;
    inline bool pairup(int u) {
        if(upd[u]) return false;
        upd[u] = true;
        for(int v : g[u]) if(!l[v] || pairup(l[v]))
            return r[l[v] = u] = v, true;
    }
public:
    Matcher(int n, int m) : n(n), m(m), l(m + 1, 0), r(n + 1, 0), upd(n + 1, false), g(n + 1) {}
    void add_edge(int u, int v) { g[u].push_back(v); }
    vector <pair <int, int>> match() {
        for(bool ok = true; ok; fill(upd.begin(), upd.end(), false)) {
            ok = false;
            for(int u = 1; u <= n; u++) if(!r[u])
                ok |= pairup(u);
        }
        vector <pair <int, int>> sol;
        for(int u = 1; u <= n; u++)
            if(r[u])
                sol.emplace_back(u, r[u]);
        return sol;
    }
};

int main()
{
    int n, m, e;
    fin >> n >> m >> e;
    Matcher M(n, m);
    for(int i = 1, u, v; i <= e; i++)
        fin >> u >> v,
        M.add_edge(u, v);
    auto v = M.match();
    fout << v.size() << "\n";
    for(auto x : v)
        fout << x.first << " " << x.second << "\n";
    return 0;
}