#include<stdio.h>
#include<iostream>
#include<queue>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
const int maxn = 5e3+10;

Pii a[maxn];
ll suf[maxn];
priority_queue<int,vector<int>,greater<int> > q;

const int N=1e4+10;
ll dp[N];

int main(){
    int n,W,k;  cin>>n>>W>>k;
    rep(i,1,n) scanf("%d%d",&a[i].first,&a[i].second);
    sort(a+1,a+n+1);

    suf[n+1]=0;
    per(i,n,n-k+1) suf[i]=suf[i+1]+a[i].second,q.push(a[i].second);
    per(i,n-k,1){
        suf[i]=suf[i+1];
        if(k>0&&a[i].second>q.top()){
            suf[i]-=q.top();
            q.pop(),q.push(a[i].second);
            suf[i]+=a[i].second;
        }
    }
    
    ll ans=suf[n-k+1];
    // ll ans=0;
    rep(i,1,n-k){
        per(j,W,a[i].first){
            dp[j]=max(dp[j],dp[j-a[i].first]+a[i].second);
        }
        ans=max(ans,dp[W]+suf[i+1]);
    }
    cout<<ans<<endl;
    fflush(stdin); 
    getchar();
}
/*
4 4 0
2 1
1 10
2 5
2 20
*/