#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    fast_io();
    int n;
    long long m, q;
    cin >> n >> m >> q;
    vector<long long> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    vector<long long> asum(1 << n), bsum(1 << n);
    vector<long long> f(1 << n), g(1 << n);
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                asum[i] += a[j];
                bsum[i] += b[j];
            }
        }
        if (asum[i] <= m) {
            f[i] = 1;
        }
        if (asum[i] <= q) {
            g[i] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int x = 0; x < (1 << n); x++) {
            if (x & (1 << i)) {
                f[x] += f[x ^ (1 << i)];
                g[x] += g[x] + g[x ^ (1 << i)];
            }
        }
    }
    vector<long long> h(1 << n);
    for (int i = 0; i < (1 << n); i++) {
        h[i] = f[i] * g[i];
    }
    for (int i = 0; i < n; i++) {
        for (int x = 0; x < (1 << n); x++) {
            if (x & (1 << i)) {
                h[x] = h[x] - h[x ^ (1 << i)];
            }
        }
    }
    long long ans = 0;
    for (int i = 0; i < (1 << n); i++) {
        if (h[i] > 0) {
            ans = max(ans, bsum[i]);
        }
    }
    cout << ans << endl;
}