/*
EDMONDS-KARP
#include <bits/stdc++.h>
using namespace std;

const int NMAX = 1e3;
int capacitate[NMAX + 1][NMAX + 1], flux[NMAX + 1][NMAX + 1];
int vis[NMAX + 1], p[NMAX + 1];
vector<int> G[NMAX + 1];
int n, m;

int bfs(int s, int d) {
    for(int i = 1; i <= n; i++) {
        vis[i] = 0;
        p[i] = 0;
    }
    queue<int> q;
    q.push(s);
    vis[s] = 1;
    while(!q.empty()) {
        int nod = q.front();
        q.pop();
        for(auto vecin : G[nod]) {
            if(!vis[vecin] && capacitate[nod][vecin] - flux[nod][vecin] > 0) {
                vis[vecin] = 1;
                q.push(vecin);
                p[vecin] = nod;
            }
        }
    }
    if(vis[d] == 0) {
        return 0;
    }
    vector<int> path;
    while(d != 0) {
        path.push_back(d);
        d = p[d];
    }
    reverse(path.begin(), path.end());
    int flow = 1e9;
    for(int i = 0; i < path.size() - 1; i++) {
        int x = path[i];
        int y = path[i + 1];
        flow = min(flow, capacitate[x][y] - flux[x][y]);
    }
    for(int i = 0; i < path.size() - 1; i++) {
        int x = path[i];
        int y = path[i + 1];
        flux[x][y] += flow;
        flux[y][x] -= flow;
    }
    return flow;
}

int main() {
    ifstream cin("maxflow.in");
    ofstream cout("maxflow.out");
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        capacitate[x][y] = c;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    int maxflow = 0;
    while(true) {
        int flow = bfs(1, n);
        if(flow == 0) {
            break;
        }
        maxflow += flow;
    }
    cout << maxflow;
}
*/

#include <iostream>
#include <fstream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

const int NMAX = 1000;

int capacitate[NMAX + 1][NMAX + 1], flux[NMAX + 1][NMAX + 1];
int vis[NMAX + 1], p[NMAX + 1];
vector<int> G[NMAX + 1];
int n, m;

int bfs(int s, int d) {
    for (int i = 0; i <= n + m + 1; i++) {
        vis[i] = 0;
        p[i] = 0;
    }

    queue<int> q;
    q.push(s);
    vis[s] = 1;

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (auto vecin : G[nod]) {
            if (!vis[vecin] && capacitate[nod][vecin] - flux[nod][vecin] > 0) {
                vis[vecin] = 1;
                q.push(vecin);
                p[vecin] = nod;
            }
        }
    }

    if (vis[d] == 0) return 0;

    vector<int> path;
    while (d != 0) {
        path.push_back(d);
        d = p[d];
    }
    reverse(path.begin(), path.end());

    int flow = 1e5;
    for (int i = 0; i < (int)path.size() - 1; i++) {
        int x = path[i];
        int y = path[i + 1];
        flow = min(flow, capacitate[x][y] - flux[x][y]);
    }

    for (int i = 0; i < (int)path.size() - 1; i++) {
        int x = path[i];
        int y = path[i + 1];
        flux[x][y] += flow;
        flux[y][x] -= flow;
    }

    return flow;
}

int main() {
    ifstream cin("cuplaj.in");
    ofstream cout("cuplaj.out");

    int e;
    cin >> n >> m >> e;

    int S = 0;
    int T = n + m + 1;

    for (int i = 0; i <= n + m + 1; i++) {
        for (int j = 0; j <= n + m + 1; j++) {
            capacitate[i][j] = 0;
            flux[i][j] = 0;
        }
        G[i].clear();
    }

    for (int i = 1; i <= e; i++) {
        int a, b;
        cin >> a >> b;
        int dreapta = n + b;

        capacitate[a][dreapta] = 1;
        G[a].push_back(dreapta);
        G[dreapta].push_back(a);
    }

    for (int i = 1; i <= n; i++) {
        capacitate[S][i] = 1;
        G[S].push_back(i);
        G[i].push_back(S);
    }

    for (int j = 1; j <= m; j++) {
        int nodD = n + j;
        capacitate[nodD][T] = 1;
        G[nodD].push_back(T);
        G[T].push_back(nodD);
    }

    int maxflow = 0;
    while (true) {
        int flow = bfs(S, T);
        if (flow == 0) break;
        maxflow += flow;
    }

    cout << maxflow << "\n";
    for (int i = 1; i <= n; i++) {
        for (int j = n + 1; j <= n + m; j++) {
            if (flux[i][j] == 1) {
                cout << i << " " << (j - n) << "\n";
            }
        }
    }

    return 0;
}