HDU - 2063
#include<bits/stdc++.h>
using namespace std;
#define maxn 1005
vector<int>mmp[maxn];
int n,m,k,b,g,ans,boy[maxn];
bool vis[maxn];
bool FIND(int x)
{
for(int j=0; j<mmp[x].size(); j++)
{
if(vis[mmp[x][j]]==0)
{
vis[mmp[x][j]]=1;
if(boy[mmp[x][j]]==0||FIND(boy[mmp[x][j]]))
{
boy[mmp[x][j]]=x;
return 1;
}
}
}
return 0;
}
int main()
{
while(cin>>k>>m>>n)
{
for(int i=1; i<=m; i++)
mmp[i].clear();
memset(boy,0,sizeof(boy));
ans=0;
if(k==0)
break;
while(k--)
{
cin>>g>>b;
mmp[g].push_back(b);
}
for(int i=1; i<=m; i++)
{
memset(vis,0,sizeof(vis));
if(FIND(i))
ans++;
}
cout<<ans<<endl;
}
return 0;
}