#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

int main(){
    ll n,m,q;
    cin >> n >> m >> q;
    VL a(n),b(n);
    rep(i,n) cin >> a[i] >> b[i];
    ll ans = 0;
    VL state;
    auto calc = [&](){
        ll res = 0;
        ll summ = 0,sumq = 0;
        rep(i,n){
            if(state[i] == 1){
                res += b[i];
                summ += a[i];
            }
            if(state[i] == 2){
                res += b[i];
                sumq += a[i];
            }
        }
        if(summ <= m && sumq <= q) return res;
        else return -INF;
    };
    auto dfs = [&](auto &dfs,ll i) -> void {
        if(i == n){
            chmax(ans,calc());
            return;
        }
        rep(v,3){
            state.emplace_back(v);
            dfs(dfs,i+1);
            state.pop_back();
        }
        return;
    };
    dfs(dfs,0);
    out(ans);
}