#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll N = 5e3 + 10;
ll n, W, k;
ll dp[N][10010];
void solve(){
    cin >> n >> W >> k;
    vector<pii> p(n + 1);
    for(ll i = 1; i <= n; i++)
    {
        auto &[x, y] = p[i];
        cin >> x >> y;
    }
    sort(p.begin() + 1, p.end());
    for(ll i = 1; i <= n; i++)
    {
        auto [x, y] = p[i];
        //cout << x << ' ' << y << endl;
        for(ll j = x; j <= W; j++)
        {
            dp[i][j] = dp[i - 1][j];
            dp[i][j] = max(dp[i][j], dp[i - 1][j - x] + y);
        }
    }
    if(k == 0)
    {
        cout << dp[n][W] << '\n';
        return ;
    }
    vector<ll> mx(n + 1);
    priority_queue<ll,vector<ll>, greater<>> q;
    ll sum = 0;
    for(ll i = n; i >= 1; i--)
    {
        auto [x, y] = p[i];
        if(q.empty() || q.size() < k) q.push(y), sum += y;
        else
        {
            auto t = q.top();
            if(y > t) q.pop(), q.push(y), sum += y - t;
        }
        mx[i] = sum;
    }
    ll res = mx[1];
    for(ll i = 1; i < n; i++)
    {
        ll tsum = dp[i][W] + mx[i + 1];
        //cout << i << ' ' << tsum << endl;
        res = max(tsum,  res);
    }
    res = max(res, dp[n][W]);
    cout << res << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll t = 1;
    //cin >> t;
    while(t --){
        solve();
    }
    return 0;
}