import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { static int[] lefts; static int[] rights; static int[] values; static long[][][] dp; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int x = sc.nextInt(); int y = sc.nextInt(); lefts = new int[n]; rights = new int[n]; values = new int[n]; dp = new long[n][x + 1][y + 1]; for (int i = 0; i < n; i++) { lefts[i] = sc.nextInt(); rights[i] = sc.nextInt(); values[i] = sc.nextInt(); for (long[] arr : dp[i]) { Arrays.fill(arr, -1); } } System.out.println(dfw(n - 1, x, y)); } static long dfw(int idx, int v, int w) { if (v < 0 || w < 0) { return Long.MIN_VALUE; } if (idx < 0) { return 0; } if (dp[idx][v][w] < 0) { dp[idx][v][w] = Math.max(dfw(idx - 1, v, w), dfw(idx - 1, v - lefts[idx], w - rights[idx]) + values[idx]); } return dp[idx][v][w]; } } 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(); } } }