#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,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> uo(1<<n);
    for (int i = 0; i < (1<<n); ++i) {
        ll sum = 0, val = 0;
        for (int j = 0; j < n; ++j) {
            if ((1<<j)&i) {
                sum += a[j], val += b[j];
            }
        }
        if (sum <= q) uo[i] = val;
        for (int j = 0; j < n; ++j) {
            if ((1<<j)&i) uo[i] = max(uo[i], uo[i-(1<<j)]);
        }
    }
    ll res = 0;
    for (int i = 0; i < (1<<n); ++i) {
        ll sum = 0, val = 0;
        for (int j = 0; j < n; ++j) {
            if ((1<<j)&i) {
                sum += a[j], val += b[j];
            }
        }
        if (sum <= m) {
            res = max(res, val+uo[(1<<n)-1-i]);
        }
    }
    cout << res << endl;
}