N, M, Q = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]

INF = 10**18

dp = [[INF]*(1<<N) for _ in range(2)]
dp[0][0] = 0
for i in range(2):
    for bit in range(1<<N):
        if dp[i][bit] == INF:
            continue
        for j in range(N):
            if not 1<<j & bit:
                A = AB[j][0]
                if i == 0:
                    if dp[i][bit]+A <= M:
                        dp[i][bit|1<<j] = min(dp[i][bit|1<<j], dp[i][bit]+A)
                    if A <= Q:
                        dp[i+1][bit|1<<j] = min(dp[i+1][bit|1<<j], A)
                else:
                    if dp[i][bit]+A <= Q:
                        dp[i][bit|1<<j] = min(dp[i][bit|1<<j], dp[i][bit]+A)

ans = 0
for i in range(2):
    for bit in range(1<<N):
        if dp[i][bit] == INF:
            continue
        SUM = 0
        for j in range(N):
            if 1<<j & bit:
                SUM += AB[j][1]
        ans = max(ans, SUM)

print(ans)