#include <bits/stdc++.h>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
const int nmax = 10005;
int N,M,E,ans;
int st[nmax],dr[nmax];
bool viz[nmax];
vector < int > L[nmax];


inline void Read()
{
    int x,y;
    fin >> N >> M >> E;
    while(E--)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}


inline bool Cupleaza(int nod)
{
    if(viz[nod]) return false;
    viz[nod] = true;
    int i;
    for(auto it: L[nod])
        if(!dr[it])
    {
        st[nod] = it;
        dr[it] = nod;
        return true;
    }
    for(auto it : L[nod])
        if(dr[it] && Cupleaza(dr[it]))
        {
            st[nod] = it;
            dr[it] = nod;
            return true;
        }
    return false;
}


inline void Solve()
{
    int i;
    int gata = 0;

    while(!gata)
    {
        gata = 1;
        for(i = 1; i <= N; i++) viz[i] = false;
        for(i = 1; i <= N; i++)
            if(!st[i] && Cupleaza(i))
            {
                ans++;
                gata = 0;
            }
    }
    fout << ans << "\n";
    for(i = 1; i <= N; i++)
        if(st[i]) fout << i << " " << st[i] << "\n";
}

int main()
{
    Read();
    Solve();
    return 0;
}