#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
// #include <bits/std++.h>
#define in  fin
#define out fout

using namespace std;
const int NMAX = 1e5 + 5;

ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");

vector<int> g[NMAX];
int cuplaj[NMAX]; // cu cine e cuplat
bool ok[NMAX];

bool pair_up(int nod){ // nod e DOAR pe partea st
    if(ok[nod]) return 0;
    ok[nod] = 1;

    for(const int &cop : g[nod]){
        if(!cuplaj[cop] || pair_up( cuplaj[cop] )){
            cuplaj[nod] = cop;
            cuplaj[cop] = nod;
            return 1;
        }
    }
    return 0;
}

signed main(){
    ios_base::sync_with_stdio(false);
    in.tie(NULL);

    int n, m, e; in >> n >> m >> e;
    for(int i = 0; i < e; i++){
        int x, y; in >> x >> y;
        g[x].push_back(y + n);
    }

    bool bezar_colba_locul_1 = 1; // cat timp e bine..
    int sol = 0;
    while(bezar_colba_locul_1){
        bezar_colba_locul_1 = 0; // oh no
        for(int i = 0; i <= n; i++) ok[i] = 0;
        for(int i = 1; i <= n; i++){
            if(!cuplaj[i] && pair_up(i)){
                sol++;
                bezar_colba_locul_1 = 1;
            }
        }
    }

    out << sol << '\n';
    for(int i = 1; i <= n; i++){
        if(cuplaj[i]){
            out << i << " " << cuplaj[i] - n << '\n';
        }
    }

    return 0;
}