#include<bits/stdc++.h>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
const int Nmax = 10001;
vector<int> L[Nmax];
int l[Nmax],r[Nmax],mk[Nmax];
int n,m,q;
int cup(int x){
    if(mk[x]) return 0;
    mk[x]=1;
    for(int i=0;i<L[x].size();i++){
        if(r[L[x][i]]==0 || cup(r[L[x][i]])){
            l[x]=L[x][i];
            r[L[x][i]]=x;
            return 1;
        }
    }
    return 0;
}
int main(){
    in>>n>>m>>q;
    for(int i=1;i<=q;i++){
        int x,y;
        in>>x>>y;
        L[x].push_back(y);
    }
    for(int i=1;i<=n;i++){
        if(!l[i]){
            fill_n(mk+1,n,0);
            mk[0]+=cup(i);
        }
    }
    out<<mk[0]<<'\n';
    for(int i=1;i<=n;i++){
        if(l[i]) out<<i<<' '<<l[i]<<'\n';
    }
    return 0;
}