#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=5010;
const int inf=1e18;
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<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,m,k,ans;
pii a[maxn];
priority_queue<int,vector<int>,greater<int>> q;
int val[maxn];
int dp[maxn][maxn<<1];
void work(){
	n=read();m=read();k=read();
	for(int i=1;i<=n;i++)a[i]={read(),read()};
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		for(int j=0;j<=m;j++)dp[i][j]=dp[i-1][j];
		for(int j=a[i].fi;j<=m;j++)dp[i][j]=max(dp[i][j],dp[i-1][j-a[i].fi]+a[i].se);
		for(int j=1;j<=m;j++)dp[i][j]=max(dp[i][j],dp[i][j-1]);
	}
	for(int i=n;i>=n-k+1;i--)val[n-k+1]+=a[i].se,q.push(a[i].se);
	for(int i=n-k;i;i--){
		val[i]=val[i+1];
		if(a[i].se>q.top()){
			val[i]+=a[i].se-q.top();
			q.pop(),q.push(a[i].se);
		}
	}
	for(int i=1;i<=n;i++)ans=max(ans,dp[i-1][m]+val[i]);
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}