import java.util.Scanner;

public class Main {
    static int[][] map;
    static int k, n, m, res;
    static int[] a;
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        while (input.hasNext()) {
            res = 0;

            k = input.nextInt();

            if(k ==0)
                break;
            n = input.nextInt();
            m = input.nextInt();
            a = new int[m + 1];

            map = new int[n + 1][m + 1];

            for (int i = 0; i < k; i++) {
                int x, y;
                x = input.nextInt();
                y = input.nextInt();
                map[x][y] = 1;
            }

            dfs(1, 0);

            System.out.println(res);

        }

    }

    public static void dfs(int index, int count){
        if(index>n){
            if(count>res){
                res = count;
            }
            return;
        }

        for (int i=1; i<=m; i++){
            if(map[index][i]==1 && a[i]==0){
                a[i] = 1;
                dfs(index+1, count+1);
                a[i] =0;
            }
        }

        dfs(index+1, count);



    }
}

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    static int[][] map = new int[501][501];//用来存女生是否中意男生
    static int k, n, m;
    static int[] a = new int[501], b = new int[501];//a数组用来标记选取状况0-1，b数组存的是选中这个男生的女生编号
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        while (input.hasNext()) {
            k = input.nextInt();
            if(k ==0)
                break;

            n = input.nextInt();
            m = input.nextInt();
            //初始化操作，因为有多组数据，所以每次循环要初始化为0
            Arrays.fill(b, 0);
            for (int i=0; i<=n; i++){
                Arrays.fill(map[i], 0);
            }

            int x, y;

            for (int i = 0; i < k; i++) {
                x = input.nextInt();
                y = input.nextInt();
                map[x][y] = 1;
            }

            int res=0;
            for(int i=1; i<=n; i++){//遍历每个女生
                Arrays.fill(a, 0);
                if(dfs(i))//查看女生是否能找到伴，是就res+1
                    res++;
            }

            System.out.println(res);//最后输出结果

        }

    }

    public static boolean dfs(int index){
        for (int i=1; i<=m; i++){//遍历每个男生
            if(map[index][i]==1 && a[i]==0){//中意，并且没有被标记
                a[i]=1;//先将男生i标记为选中
                if(b[i]==0 || dfs(b[i])){//假如b[i]==0就是说男生还没有被选, 就会直接执行下面的，如果b[i]不等于0，dfs(b[i])就让选中该男生的女生换一个选。
                    b[i] = index;//标记第i个男生的女伴为index
                    return true;
                }
            }
        }

        return false;

    }
}