import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int a = sc.nextInt(); int b = sc.nextInt(); int[] prices = new int[n]; int[] values = new int[n]; for (int i = 0; i < n; i++) { prices[i] = sc.nextInt(); values[i] = sc.nextInt(); } long[] weights = new long[1 << n]; long[][] dp = new long[1 << n][2]; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if ((i & (1 << j)) == 0) { continue; } weights[i] = weights[i ^ (1 << j)] + prices[j]; if (weights[i] <= a) { dp[i][0] = dp[i ^ (1 << j)][0] + values[j]; } if (weights[i] <= b) { dp[i][1] = dp[i ^ (1 << j)][1] + values[j]; } break; } for (int j = 0; j < n; j++) { if ((i & (1 << j)) == 0) { continue; } dp[i][0] = Math.max(dp[i][0], dp[i ^ (1 << j)][0]); dp[i][1] = Math.max(dp[i][1], dp[i ^ (1 << j)][1]); } } long ans = 0; for (int i = 0; i < (1 << n); i++) { ans = Math.max(ans, dp[i][0] + dp[((1 << n) - 1) ^ i][1]); } System.out.println(ans); } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }