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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M,Q; cin >> N >> M >> Q;
    int A[N],B[N];
    for(int i=0; i<N; i++) cin >> A[i] >> B[i];

    int n2 = 1<<N,inf = max(M,Q);
    int S[n2];
    long long S2[n2];
    for(int i=0; i<n2; i++){
        S[i] = 0; S2[i] = 0;
        for(int k=0; k<N; k++){
            if(!(i&(1<<k))) continue;
            S[i] += A[k];
            S2[i] += B[k];
            if(S[i] > inf) break;
        }
    }

    long long answer = 0;
    for(int i=0; i<n2; i++){
        if(S[i] <= M || S[i] <= Q){answer = max(answer,S2[i]); continue;}

        for(int k=(i-1)&i; k>0; k=(k-1)&i){
            if(S[k] > M) continue;
            int left = i-k;
            if(S[left] > Q) continue;
            answer = max(answer,S2[i]); break;
        }
    }
    cout << answer << endl;
}