#include <bits/stdc++.h>
using namespace std;

const int NMAX = 20000;
int flux[NMAX + 1][NMAX + 1];
int capacitate[NMAX + 1][NMAX + 1];
vector<int> G[NMAX + 1];
int vis[NMAX + 1], p[NMAX + 1];
int n1,n2, m;

int bfs(int s, int d) {
    queue<int> q;
    for(int i = 0; i <= n1+n2+1; i++) {
        vis[i] = 0;
        p[i] = -1;
    }
    q.push(s);
    vis[s] = 1;
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        for(auto y : G[x]) {
            if(!vis[y] && capacitate[x][y] - flux[x][y] > 0) {
                vis[y] = 1;
                q.push(y);
                p[y] = x;
            }
        }
    }
    if(vis[d] == 0) {
        return 0;
    }
    vector<int> path;
    int r = d;
    while(r != -1) {
        path.push_back(r);
        r = p[r];
    }
    reverse(path.begin(), path.end());
    int mn = 1e9;
    for(int i = 0; i < path.size() - 1; i++) {
        int x = path[i];
        int y = path[i + 1];
        mn = min(mn, 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] += mn;
        flux[y][x] -= mn; 
    }
    return mn;

}

int main() {
	ifstream cin("cuplaj.in");
    ofstream cout("cuplaj.out");
    cin >> n1 >>n2>> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y ;
        capacitate[x][y+n1] = 1;
        G[x].push_back(y+n1);
        G[y+n1].push_back(x);
    }
    for (int i=1;i<=n1;i++)
    {
        capacitate[0][i]=1;
        G[0].push_back(i);
    }
    for(int i=n1+1;i<=n1+n2;i++)
    {
        capacitate[i][n1+n2+1]=1;
        G[i].push_back(n1+n2+1);
    }
    int sum = 0;
    while(1) {
        int flux = bfs(0, n1+n2+1);
        sum += flux;
        if(flux == 0) {
            break;
        }
    }
    cout << sum<<endl;
    for(int i=1;i<=n1;i++)
        for(int j=n1+1;j<=n1+n2;j++)
        {
            if(capacitate[i][j]==1 && flux[i][j]==1)
                cout<<i<<" "<<j-n1<<endl;
        }
}