#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "cuplaj";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 100005;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

Graph G;
int L, R, M, Pair[MAXN], Cuplaj[MAXN], Sol;
bitset<MAXN> Used;

inline bool PairUp(int Node) {
    if(Used[Node])
        return false;
    Used[Node] = true;
    for(It it = G[Node].begin(), fin = G[Node].end(); it != fin ; ++ it)
        if(!Pair[*it] || PairUp(Pair[*it])) {
            Pair[*it] = Node;
            Cuplaj[Node] = *it;
            return true;
        }
    return false;
}

int main() {
    cin >> L >> R >> M;
    for(int i = 1 ; i <= M ; ++ i) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
    }
    for(bool ok = true ; ok ; ) {
        ok = false;
        Used.reset();
        for(int i = 1 ; i <= L ; ++ i)
            if(!Cuplaj[i]) {
                if(PairUp(i)) {
                    ok = true;
                    ++ Sol;
                }
            }
    }
    cout << Sol << '\n';
    for(int i = 1 ; i <= L ; ++ i)
        if(Cuplaj[i])
            cout << i << ' ' << Cuplaj[i] << '\n';
    cin.close();
    cout.close();
    return 0;
}