#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; ll m, q; cin >> n >> m >> q;
	vector<ll> a(n), b(n);
	rep(i,0,n) cin >> a[i] >> b[i];
	
	vector<ll> sum_a(1 << n);
	vector<ll> sum_b(1 << n);
	rep(i,0,1<<n){
		rep(j,0,n){
			if (i >> j & 1){
				sum_a[i] += a[j];
				sum_b[i] += b[j];
			}
		}
	}


	vector<bool> can_m(1 << n);
	vector<bool> can_q(1 << n);
	rep(i,0,1<<n){
		if (sum_a[i] <= m) can_m[i] = 1;
		if (sum_a[i] <= q) can_q[i] = 1;
	}

	ll ans = 0;
	rep(i,0,1<<n){
		if (can_m[i]){
			int d = ((1 << n) - 1) ^ i;
			int j = d;
			do {
				if (can_q[j]){
					chmax(ans, sum_b[i] + sum_b[j]);
				}
				j = (j-1) & d;
			}while(j != d);
		}
	}
	cout << ans << '\n';
}