#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "cuplaj.in";
const char outfile[] = "cuplaj.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 10005;
const int oo = 0x3f3f3f3f;

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; }

Graph G;
int N, M, E, cuplaj[MAXN], pereche[MAXN];
bitset<MAXN> Used;

bool pairUp(const int &Node) {
    if(Used[Node])
        return false;
    Used[Node] = true;
    for(It it = G[Node].begin(), fin = G[Node].end(); it != fin ; ++ it)
        if(!pereche[*it] || pairUp(pereche[*it])) {
            pereche[*it] = Node;
            cuplaj[Node]= *it;
            return true;
        }
    return false;
}

int main() {
    fin >> N >> M >> E;
    for(int i = 1 ; i <= E ; ++ i) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    int Ans = 0;
    for(bool change = true ; change ; ) {
        change = false;
        Used.reset();
        for(int i = 1 ; i <= N ; ++ i)
            if(!cuplaj[i])
                if(pairUp(i)) {
                    ++ Ans;
                    change = true;
                }
    }
    fout << Ans << '\n';
    for(int i = 1 ; i <= N ; ++ i)
        if(cuplaj[i])
            fout << i << ' ' << cuplaj[i] << '\n';
    fin.close();
    fout.close();
    return 0;
}