#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int cuplaj[20005],viz[20005];
int na,m,e,n;
struct nod
{
    int inf;
    nod* urm;
}*v[20005];
int vecin(int x)
{

    nod *p;
    p=v[x];
    while(p)
      if(c[p->inf]==-1)return p->inf;
      else p=p->urm;

    return -1;
}
void construire()
{
    int i,k;
    for(i=1;i<=na;i++)
       {
          k=vecin(i);
          if(k!=-1)
          {c[i]=k;
          c[k]=i;break;}
       }
}
int dfs(int i)
{
    int j,k;
    viz[i]=1;
    nod *p;
    p=v[i];
    while(p)
       {
           k=p->inf;
           if(viz[k]||c[i]==k) goto blabla;
           if(c[k]==-1)
           {
               viz[k]=1;
               c[k]=i;
               c[i]=k;
               return 1;
           }
           else
              {
                  viz[k]=1;
                  if(dfs(c[k]))
                     {
                         c[i]=k;
                         c[k]=i;
                         return 1;
                     }
              }
              blabla:
              p=p->urm;
       }
    return 0;
}
int main()
{
    int x,y,i,j,ok=1,nr=0;
    nod *p;
    f>>na>>m>>e;
    n=na+m;
    for(i=1;i<=n;i++)c[i]=-1;
    for(i=1;i<=e;i++)
      {
          f>>x>>y;
          y=y+na;

          adauga(x,y);
          adauga(y,x);
      }
      construire();
      while(ok)
      {
          ok=0;
          for(i=1;i<=n;i++)viz[i]=0;
          for(i=1;i<=na;i++)
             if(viz[i]==0&&c[i]==-1)
                 if(dfs(i))ok=1;
      }
    for(i=1;i<=na;i++)if(c[i]!=-1)nr++;
    g<<nr<<"\n";
    for(i=1;i<=na;i++)
       if(c[i]!=-1)
          g<<i<<" "<<c[i]-na<<"\n";
    return 0;
}