#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ii pair<int , int>
#define pq priority_queue
#define iii pair<int , pair<int , int>>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define fod(i,r,l) for(int i=r;i>=l;i--)
#define fill(f,x) memset(f,x,sizeof(f))
#define NAME "file"

const int N = 2e5 + 5, mod = 1e9 + 7;
int n , U , V , a[21] , b[21] , p[21] , ans = 0;

void sol(int i)
{
    if (i > n)
    {
        int wei = 0 , val = 0;
        for (int j = 0 ; j <= n ; j++)
        {
            wei += p[j] * a[j]; // giống if (p[j]) wei += a[j]
            val += p[j] * b[j];
        }
        if (wei >= U && wei <= V)
            ans = max(ans , val);
    }
    else
    {
       for (int j = 0 ; j <= 1 ; j++)
       {
            p[i] = j;
            sol(i + 1);
       }
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);  cout.tie(0);
    //freopen(NAME".INP" , "r" , stdin);
    //freopen(NAME".OUT" , "w" , stdout);
 
    cin >> n >> U >> V;
    for (int i = 1 ; i <= n ; i++)
        cin >> a[i] >> b[i];
    sol(1);
    cout << ans;
}
// haronnee_