#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
	vector<long long>a(n), b(n);
	rep(i, n)cin >> a[i] >> b[i];
	vector<long long> dp0(1 << n), dp1(1 << n);
	rep(i, 1 << n) {
		long long sa = 0;
		long long sb = 0;
		rep(j, n) {
			if (1 & (i >> j)) {
				sa += a[j];
				sb += b[j];
			}
		}
		if (sa <= m)dp0[i] = sb;
		if (sa <= q)dp1[i] = sb;
	}
	rep(j, n) {
		rrep(i, 1 << n) {
			if (1 & (i >> j)) chmax(dp1[i], dp1[i & ~(1 << j)]);
		}
	}
	long long ans = 0;
	const int mask = (1 << n) - 1;
	rep(i, 1 << n) {
		int j = mask - i;
		chmax(ans, dp0[i] + dp1[j]);
	}
	cout << ans << endl;
	return 0;
}