N,M,Q = map(int, input().split())
A = []
B = []
for i in range(N):
    a,b = map(int, input().split())
    A.append(a)
    B.append(b)
    
dp1 = [0] * (1<<N)#iの部分集合の中で最も価値が高いパターン
dp2 = [0] * (1<<N)
for i in range(1<<N):
    a_sum = 0
    b_sum = 0
    for j in range(N):
        if (i>>j) & 1:
            a_sum += A[j]
            b_sum += B[j]
    if a_sum <= M:
        dp1[i] = b_sum
    if a_sum <= Q:
        dp2[i] = b_sum

for i in range(N):
    for j in range(1<<N):
        if (j&(1<<i)):
            dp1[j] = max(dp1[j],dp1[j-(1<<i)])

for i in range(N):
    for j in range(1<<N):
        if (j&(1<<i)):
            dp2[j] = max(dp2[j],dp2[j-(1<<i)])
ans = 0
for i in range(1<<N):
    comp_bit = ((1<<N)-1) ^ i
    ans = max(ans,dp1[i]+dp2[comp_bit])
print(ans)