#include<bits/stdc++.h>
#define rep(a,b,c) for(int c(a);c<=(b);++c)
#define drep(a,b,c) for(int c(a);c>=(b);--c)
using namespace std;
inline int read()
{
	int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
	while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
priority_queue<int,vector<int> ,greater<int> > h;
const int N=5010,WW=10010;
int n,W,K,f[WW],g[WW],s[N];
struct Node
{
	int v,w;
	inline bool operator < (const Node&x)const
	{
		return w==x.w?v<x.v:w<x.w;
	}
}a[N];
inline void Solve()
{
	n=read();W=read();K=read();
	rep(1,n,i)a[i].w=read(),a[i].v=read();
	sort(a+1,a+n+1);while(!h.empty())h.pop();
	s[n+1]=0;
	drep(n,max(1,n-K+1),i)
	{
		h.push(a[i].v);
		s[i]=s[i+1]+a[i].v;
	}
	drep(n-K,1,i)
	{
		s[i]=s[i+1];
		if(a[i].v>h.top())
		{
			s[i]-=h.top();h.pop();
			s[i]+=a[i].v;h.push(a[i].v);
		}
	}
	memset(f,0,sizeof(f));
	int ans=s[1];
	rep(1,n,i)
	{
		memcpy(g,f,sizeof(f));
		memset(f,0,sizeof(f));
		rep(0,W,j)
		{
			f[j]=g[j];
			if(j>=a[i].w)f[j]=max(f[j],g[j-a[i].w]+a[i].v);
		}
		ans=max(ans,f[W]+s[i+1]);
	}
	printf("%d\n",ans);
}
int main()
{
	int T=1;
	while(T--)Solve();
	return 0;	
}