import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int q = sc.nextInt();
		int[] a = new int[n];
		int[] b = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
			b[i] = sc.nextInt();
		}
		sc.close();

		int n2 = 1 << n;
		long[] c = new long[n2];
		long[] dp1 = new long[n2];
		long[] dp2 = new long[n2];
		for (int i = 0; i < n2; i++) {
			for (int j = 0; j < n; j++) {
				if ((i >> j & 1) == 0) {
					int ni = i | (1 << j);
					c[ni] = c[i] + a[j];
					if (c[ni] <= m) {
						dp1[ni] = dp1[i] + b[j];
					} else {
						dp1[ni] = Math.max(dp1[ni], dp1[i]);
					}
					if (c[ni] <= q) {
						dp2[ni] = dp2[i] + b[j];
					} else {
						dp2[ni] = Math.max(dp2[ni], dp2[i]);
					}
				}
			}
		}

		long ans = 0;
		int all = n2 - 1;
		for (int i = 0; i < n2; i++) {
			int i2 = all - i;
			long val = dp1[i] + dp2[i2];
			ans = Math.max(ans, val);
		}
		System.out.println(ans);
	}
}