#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N;
    ll M, Q;
    cin >> N >> M >> Q;
    vector<ll> A(N), B(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i] >> B[i];
    }

    vector<ll> dp1(1 << N, -INFL), dp2(1 << N, -INFL);
    for (int i = 0; i < 1 << N; i++) {
        ll suma = 0, sumb = 0;
        for (int j = 0; j < N; j++) {
            if (i >> j & 1) {
                suma += A[j];
                sumb += B[j];
            }
            if (suma <= M) {
                dp1[i] = sumb;
            }
        }
    }
    for (int i = 0; i < 1 << N; i++) {
        for (int j = 0; j < N; j++) {
            if (i >> j & 1) continue;
            dp1[i | (1 << j)] = max(dp1[i | (1 << j)], dp1[i]);
        }
    }

    for (int i = 0; i < 1 << N; i++) {
        ll suma = 0, sumb = 0;
        for (int j = 0; j < N; j++) {
            if (i >> j & 1) {
                suma += A[j];
                sumb += B[j];
            }
            if (suma <= Q) {
                dp2[i] = sumb;
            }
        }
    }
    for (int i = 0; i < 1 << N; i++) {
        for (int j = 0; j < N; j++) {
            if (i >> j & 1) continue;
            dp2[i | (1 << j)] = max(dp2[i | (1 << j)], dp2[i]);
        }
    }

    ll ans = -INFL;
    for (int i = 0; i < 1 << N; i++) {
        ans = max(ans, dp1[i] + dp2[(1 << N) - 1 - i]);
    }
    cout << ans << endl;
}