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

#define e "\n"
#define f first
#define s second
#define ll long long
#define pb push_back
#define pi (3.141592653589)
#define V vector<long long>
#define all(v) v.begin(), v.end()
#define fr(suru,ses) for(int i=suru;i<ses;i++)

const int N=5e3;
const int M=1e4;
ll dp[N+7][M+N+7];

ll n,w,k;
vector<pair<ll,ll>>v;

ll recur(ll i,ll c){
    ll ans=0;
    if(i==n || c==0)return ans;
    if(c>w){
        ans=dp[i][c]=max(recur(i+1,c-1)+v[i].s,recur(i+1,c));
    }else {
        ans=recur(i+1,c);
        if(v[i].f<=c)ans=max(ans,recur(i+1,c-v[i].f)+v[i].s);
        dp[i][c]=ans;
    }
    return ans;
}

void solve(int t,int tc){
    memset(dp,-1,sizeof(dp));
    cin>>n>>w>>k;
    v.resize(n);
    for(int i=0;i<n;i++)cin>>v[i].f>>v[i].s;
    sort(v.rbegin(),v.rend());

    cout<<recur(0,w+k)<<e;

}

int main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t=1;   //cin>>t;
    fr(1,t+1)solve(i,t);
    return 0;
}