// Cuplaj O(sqrt(N)*M) - Lanturi alternative
// st[i]= nodul cu care am cuplat nodul i din stanga  i -> st[i]
// dr[i]= nodul cu care am cuplat nodul i din dreapta dr[i] <- i

#include <fstream>
#include <vector>
#include <bitset>
#define Nmax 10099
#define pb push_back
using namespace std;
ifstream f("cuplaj.in");  ofstream g("cuplaj.out");

int N,M,sol,E,st[Nmax],dr[Nmax];
vector < int > G[Nmax];
bitset < Nmax > viz;

void ReadInput()
{
     f>>N>>M>>E;
     for(int i=1;i<=E;++i)
     {
          int x,y;
          f>>x>>y,G[x].pb(y);
     }
}

int Cupleaza(int node)
{
     if(viz[node])return 0;
     viz[node]=1;
     for(vector<int>::iterator it=G[node].begin();it!=G[node].end();++it)
          if(!dr[*it])
          {
               st[node]=*it , dr[*it]=node;
               return 1;
          }
     for(vector<int>::iterator it=G[node].begin();it!=G[node].end();++it)
          if(Cupleaza(dr[*it]))
          {
               st[node]=*it , dr[*it]=node;
               return 1;
          }
     return 0;
}

void MakePath()
{
     int gata=0;
     while(!gata)
     {
          gata=1;
          for(int i=1;i<=N;++i)viz[i]=0;
          for(int i=1;i<=N;++i)
               if(!st[i] && Cupleaza(i))gata=0,++sol;
     }
}

void PrintOutput()
{
     g<<sol<<'\n';
     for(int i=1;i<=N;++i)
          if(st[i])g<<i<<' '<<st[i]<<'\n';
}
int main()
{
     ReadInput();
     MakePath();
     PrintOutput();
     f.close();g.close();
     return 0;
}