#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "templates/debug.h"
#else
#define dbg(...) (void)0
#define msg(...) (void)0
#endif
#define ll long long
#define endl '\n'
#define PB emplace_back
#define PPB pop_back
#define MP make_pair
#define ALL(Name) Name.begin(),Name.end()
#define PII pair<int,int>
#define VI vector<int>
#define fi first
#define se second

const int N=5005,M=10005;
int n,w,k;
ll dp[M],pre[N],suf[N],ans;
struct item
{
	int w,v;
	bool operator<(const item &rhs)const
	{
		return w<rhs.w;
	}
}a[N];

int main()
{
	ios::sync_with_stdio(false),cin.tie(nullptr);
//	int _;cin>>_;while(_--)

	cin>>n>>w>>k;
	for(int i=1;i<=n;i++)cin>>a[i].w>>a[i].v;
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		for(int j=w;j>=a[i].w;j--)
			dp[j]=max(dp[j],dp[j-a[i].w]+a[i].v);
		pre[i]=dp[w];
	}
	priority_queue<int,VI,greater<int> >q;
	for(int i=n;i;i--)
	{
		q.push(a[i].v);
		suf[i]=suf[i+1]+a[i].v;
		if(q.size()>k)suf[i]-=q.top(),q.pop();
	}
	for(int i=0;i<=n;i++)ans=max(ans,suf[i+1]+pre[i]);
	cout<<ans;

	return 0;
}