#include <bits/stdc++.h>

using namespace std;

#define INFILE "cuplaj.in"
#define OUTFILE "cuplaj.out"

const int N_MAX = 1e4 + 5;

int n, m, edges;
int l[N_MAX], r[N_MAX];
bool visited[N_MAX];
vector<int> adj[N_MAX];

void connect(int x, int y){
    l[x] = y;
    r[y] = x;
}

bool link(int node){

    if(visited[node]) return false;
    visited[node] = true;

    for(auto &it : adj[node]){
        if(!r[it]) {
            connect(node, it);
            return true;
        }
    }

    for(auto &it : adj[node]){
        if(link(r[it])){
           connect(node, it);
           return true;
        }
    }

    return false;

}

void solve(){

    cin >> n >> m >> edges;
    for(int i = 0; i < edges; ++i){
        int node1, node2;
        cin >> node1 >> node2;
        adj[node1].push_back(node2);
    }

    bool ok = true;
    while(ok) {
        ok = false;
        memset(visited, false, sizeof visited);
        for(int i = 1; i <= n; ++i){
            if(!l[i]) ok |= link(i);
        }
    }

    int ans = 0;
    for(int i = 1; i <= n; ++i){
        if(l[i]) ++ans;
    }

    cout << ans << '\n';
    for(int i = 1; i <= n; ++i){
        if(l[i]) cout << i << " " << l[i] << '\n';
    }

}

int main(){
    ios_base::sync_with_stdio(false);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    cin.tie(0), cout.tie(0);
    solve();
    return 0;
}