死在建立了双向边
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<stack>
#include<set>
#include<ctime>
#include<algorithm>
#define eps 1e-14
#define pi acos(-1)
#define ll long long
#define RD T*(rand()*2-RAND_MAX)
#define Drand (long double)rand()/RAND_MAX
#define INF 0x3f3f3f3f
#define endl '\n'
using namespace std;
const int maxn=600;
const int mod=1e4+7;
int girl[maxn],used[maxn],l[maxn][maxn];
int k,m,n;
int dfs(int x)
{
for(int i=1;i<=m;i++){
if(used[i]==0 && l[x][i]==1){
used[i]=1;
if(girl[i]==0 || dfs(girl[i])==1){
girl[i]=x;
return 1;
}
}
}
return 0;
}
int Find()
{
int ans=0;
for(int i=1;i<=n;i++){
memset(used,0,sizeof used);
if(dfs(i))ans++;
}
return ans;
}
void init()
{
memset(girl,0,sizeof girl);
memset(l,0,sizeof l);
}
int main()
{
// freopen("in.txt","r",stdin);
while(~scanf("%d",&k) && k){
init();
scanf("%d%d",&m,&n);
while(k--){
int a,b;
scanf("%d%d",&a,&b);
l[b][a]=1;
}
cout<<Find()<<endl;
}
return 0;
}