#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define sz(x) (signed)size(x)
#define w first
#define v second

void solve() {
    int n, W, k;
    cin >> n >> W >> k;

    vector<pii> items(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> items[i].w >> items[i].v;

    sort(items.begin() + 1, items.end(), [](const auto& x, const auto& y) {
            if (x.v != y.v) return x.v < y.v;
            return x.w > y.w;
            });

    vector dp(n + 1, vector<ll>(W + 1, - 1e18));
    dp[0][0] = 0;

    for (int i = 1; i <= n; ++i) {
        dp[i] = dp[i - 1];
        for (int j = W; j >= items[i].w; --j)
            dp[i][j] = max(dp[i][j], dp[i - 1][j - items[i].w] + items[i].v);
    }

    for (int i = 0; i <= n; ++i)
        for (int j = 1; j <= W; ++j)
            dp[i][j] = max(dp[i][j], dp[i][j - 1]);

    ll ans = dp[n][W], cur = 0;
    int buy = 0;
    multiset<int> free;
    for (int i = n; i > 0; --i) {
        cur += items[i].v;
        free.emplace(items[i].w);
        if (sz(free) > k) {
            buy += *free.begin();
            free.erase(*free.begin());
        }

        if (buy > W) break;
        ans = max(ans, cur + dp[i - 1][W - buy]);
    }

    cout << ans << '\n';

}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    solve();
}