#include <iostream>
#include <cstdio>
#include <vector>
#define NMAX 10000

using namespace std;

bool uz[NMAX + 5];
int n, m, e;
int l[NMAX + 5], r[NMAX + 5];
vector<int> vl[NMAX + 5], vr[NMAX + 5];

bool alternating_path(int nod) { /// true daca exista un lant alternant care pleaca din nod
  uz[nod] = true;
  for(int x: vl[nod])
    if(r[x] == 0 || (!uz[r[x]] && r[x] != nod && alternating_path(r[x]))) {
      l[nod] = x;
      r[x] = nod;
      return true;
    }
  return false;
}

int main() {
  freopen("cuplaj.in", "r", stdin);
  freopen("cuplaj.out", "w", stdout);
  int x, y;

  scanf("%d %d %d", &n, &m, &e);
  while(e) {
    scanf("%d %d", &x, &y);
    vl[x].push_back(y);
    vr[y].push_back(x);
    e--;
  }

  bool alt = true;
  int cuplaj = 0;

//  for(int i = 1; i <= m; i++) {
//    printf("Nodul %d e conectat cu: ", i);
//    for(int x: vr[i])
//      printf("%d ", x);
//    printf("\n");
//  }

  while(alt) {
    alt = false;
    for(int i = 1; i <= n; i++) {
      for(int i = 1; i <= n; i++)
        uz[i] = false;
      if(l[i] == 0 && alternating_path(i)) {
        alt = true;
        cuplaj++;
        break;
      }
    }
  }

  printf("%d\n", cuplaj);
  for(int i = 1; i <= n; i++)
    if(l[i] != 0)
      printf("%d %d\n", i, l[i]);

  return 0;
}