#include #include #define rep(i,n) for(int i=0;i vi; typedef vector vl; typedef vector> vvi; typedef vector> vvl; typedef long double ld; typedef pair P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const static_modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const dynamic_modint& a) {os << a.val(); return os;} template istream& operator>>(istream& is, vector& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template ostream& operator<<(ostream& os, const pair& p){os << p.first << ' ' << p.second; return os;} template ostream& operator<<(ostream& os, const vector& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const vector>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template void chmin(T& a, T b){a = min(a, b);} template void chmax(T& a, T b){a = max(a, b);} int main(){ int n; long long x, y; cin >> n >> x >> y; vector a(n), b(n); rep(i, n) cin >> a[i] >> b[i]; vector dp_x(1 << n); vector dp_y(1 << n); rep(bit, 1 << n){ long long a_sum = 0; long long b_sum = 0; rep(i, n){ if((bit >> i) & 1){ a_sum += a[i]; b_sum += b[i]; } } if(a_sum <= x) dp_x[bit] = b_sum; if(a_sum <= y) dp_y[bit] = b_sum; } rep(i, n) rep(bit, 1 << n){ if((bit >> i) & 1) chmax(dp_x[bit], dp_x[bit - (1 << i)]); if((bit >> i) & 1) chmax(dp_y[bit], dp_y[bit - (1 << i)]); } long long ans = 0; rep(bit, 1 << n){ long long tmp = 0; tmp += dp_x[bit]; tmp += dp_y[((1 << n) - 1) - bit]; chmax(ans, tmp); } cout << ans << "\n"; return 0; }