#include <iostream>

#include <cstdlib>

#include <cstdio>

#include <algorithm>

#include <vector>

#include <queue>

#include <cmath>

#include <stack>

#include <cstring>

using namespace std;

#define N 1100

int used[N], vis[N], maps[N][N], n, m;

bool Find(int u)

{

    for(int i=; i<=n; i++)

    {

        if(!vis[i] && maps[u][i])//判断是否被增广过并且愿意与男生i在一起；

        {

            vis[i] = ;

            if(!used[i] || Find(used[i]))//判断男生i是否被人占用，或者协商成功；

            {

                used[i] = u;

                return true;

            }

        }

    }

    return false;

}

int main()

{

    int k,a ,b;

    while(scanf("%d", &k),k)

    {

        memset(maps, , sizeof(maps));

        memset(used, , sizeof(used));

        memset(vis,  ,sizeof(vis));

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

        while(k--)

        {

            scanf("%d%d", &a, &b);

            maps[a][b] = ;

        }

        int ans = ;

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

        {

            memset(vis,  ,sizeof(vis));

            if(Find(i))

                ans++;

        }

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

    }

    return ;

}