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

int main(){
    ll n,m,q;
    cin >> n >> m >> q;
    vector<ll> a(n),b(n);
    ll n2 = 1<<n;
    vector<ll> w(n2);
    for(ll i = 0;i < n;i++){
        cin >> a[i] >> b[i];
        for(ll j = 0;j < n2;j++){
            if(j>>i&1) w[i] += a[i];
        }
    }
    vector<ll> dpm(n2),dpq(n2);
    for(ll i = 0;i < n2;i++){
        ll suma = 0,sumb = 0;
         for(ll j = 0;j < n;j++){
            if(i>>j&1){
                suma += a[j];
                sumb += b[j];
            }
        }
        if(suma <= m) dpm[i] = sumb;
        if(suma <= q) dpq[i] = sumb;
    }
    for(ll i = 0;i < n;i++){
        for(ll j = 0;j < n2;j++){
            if(j>>i&1){
                dpm[j] = max(dpm[j],dpm[j-(1<<i)]);
                dpq[j] = max(dpq[j],dpq[j-(1<<i)]);
            }
        }
    }
    ll ans = 0;
    for(ll i = 0;i < n2;i++){
        ll j = (n2-1)^i;
        ans = max(ans,dpm[i]+dpq[j]);
    }
    cout << ans << endl;
}