//ALL IN
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define int long long
#define double long double
const int N=2e5+7;
const int mod=1e9+7;
const int inf=4e18;
mt19937 rnd(time(0));
clock_t start,over;// start=clock(); last=(final-over)*1.0/1000
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0',ch=getchar();}return x*f;}
inline void write(int x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+'0');return;}
int a[N];
int f[N];
set<int>st;
map<pair<int,int>,int>mp;
struct node{
    int w,v;
}good[N];
void solve(){
    int  n,W,k;cin>>n>>W>>k;
    for(int i=1;i<=n;i++){
        cin>>good[i].w>>good[i].v;
    }
    for(int i=1;i<=n;i++){
        for(int j=W;j>=good[i].w;j--){
            int x=f[j-good[i].w]+good[i].v;
            if(x>f[j]){
                mp[{i,j}]=j-good[i].w;
                f[j]=x;
            }else{
                mp[{i,j}]=j;
            }
        }
    }
    int ans=f[W];
    int now=W;
    for(int i=n;i>=1;i--){
        if(mp[{i,now}]==now){
            continue;
        }else if(mp[{i,now}]!=0){
            int x=mp[{i,now}];
            now=x;
            st.insert(i);
        }
    }
    // cout<<ans<<'\n';
    vector<int>v;
    for(int i=1;i<=n;i++){
        if(not st.count(i)){
            // cout<<i<<'\n';
            v.push_back(good[i].v);
        }
    }
    sort(v.begin(),v.end());
    for(int i=1;i<=k and i<=v.size();i++){
        ans+=v[v.size()-i];
    }
    cout<<ans<<'\n';
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int _=1;
    // cin>>_;
    while(_--)solve();
}