#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn=505;
const int inf=0x3f3f3f3f;
int k,n,m,match[maxn];
bool line[maxn][maxn],vis[maxn];
bool dfs(int x){
for(int i=1;i<=m;i++){
if(line[x][i]&&vis[i]==false){
vis[i]=true;
if(match[i]==0||dfs(match[i])){
match[i]=x;
return true;
}
}
}
return false;
}
int main()
{
while(scanf("%d",&k),k){
scanf("%d%d",&n,&m);
memset(match,0,sizeof(match));
memset(line,false,sizeof(line));
for(int i=1;i<=k;i++){
int a,b;
scanf("%d%d",&a,&b);
line[a][b]=true;
}
int ans=0;
for(int i=1;i<=n;i++){
memset(vis,0,sizeof(vis));
if(dfs(i))
ans++;
}
printf("%d\n",ans);
}
return 0;
}