#include<bits/stdc++.h>
using namespace std;
int n,a[1005],m,k,x[1005],s,minn=1e8+9,b,ans=-1;
int dp[1005][1005];
int main(){
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
cin>>a[i]>>x[i];
s+=x[i];minn=min(minn,a[i]);
b+=a[i];
}
if(s<=m) {
cout<<b-minn<<endl;
return 0;
}
for(int i=1;i<=n;i++){
for(int j=m;j>=x[i];j--){
for(int l=k;l>=1;l--){
dp[j][l]=max(dp[j][l],max(dp[j-x[i]][l]+a[i],dp[j-x[i]][l-1]+a[i]*2));
}
}
}
cout<<dp[m][k];
return 0;
}