import sys
from collections import deque, Counter
from math import gcd, log10, pi, sqrt, ceil
from bisect import bisect, bisect_left, bisect_right, insort
from typing import Iterable, TypeVar, Union, Tuple, Iterator, List
import copy
import heapq
import itertools
import math
import random
from fractions import Fraction
from functools import lru_cache, partial, cmp_to_key
import operator
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
mod = 998244353
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]


def main():
    N, X, Y = read_values()
    L = read_lists(N)
    dp = [[[0] * (Y + 1) for _ in range(X + 1)] for _ in range(N + 1)]

    for k, (a, b, c) in enumerate(L):
        for x in range(X + 1):
            for y in range(Y + 1):
                if x + a <= X and y + b <= Y:
                    dp[k + 1][x + a][y + b] = max(dp[k + 1][x + a][y + b], dp[k][x][y] + c)
                dp[k + 1][x][y] = max(dp[k + 1][x][y], dp[k][x][y])
    
    print(max(max(v) for v in dp[N]))


if __name__ == "__main__":
    main()