#include<iostream>

#include<stdio.h>

#include<string.h>

#include<algorithm>

using namespace std;

bool line[][];

bool used[];

int girl[];

int m,n,e;

bool findd(int x){

   for (int i=;i<=n-;i++){//右边匹配情况

      if (line[x][i]== && used[i]==false)

      {

          used[i]=;

          if (girl[i]==- || findd(girl[i]))

          {

              girl[i]=x;

              return ;

          }

      }

   }

   return ;

}

int main(){

  int a;

  while(~scanf("%d",&m)){

    if (m==)break;

    memset(line,,sizeof(line));

    memset(used,,sizeof(used));

    memset(girl,-,sizeof(girl));

    scanf("%d%d",&n,&e);

    int sum=;

    int x,y;

    while(e--){

        scanf("%d%d",&x,&y);

        line[x][y]=;

    }

    for (int i=;i<=m-;i++){

        memset(used,,sizeof(used));

        if (findd(i))sum++;

    }

    printf("%d\n",sum);

  }

  return ;

}