#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

#define int int64_t

const int MAXW = 1e4 + 100;
int dp[MAXW];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, w, k;
    cin >> n >> w >> k;
    vector<array<int, 2>> arr(n);
    for (int i = 0; i < n; ++i) {
        cin >> arr[i][0] >> arr[i][1];
    }
    sort(arr.begin(), arr.end());
    vector<int> pref(n + 1);
    for (int i = 0; i < n; ++i) {
        for (int j = w; j >= 0; --j) {
            if (j + arr[i][0] <= w) {
                dp[j + arr[i][0]] = max(dp[j + arr[i][0]], dp[j] + arr[i][1]);
            }
        }
        for (int j = 0; j <= w; ++j) {
            pref[i + 1] = max(pref[i + 1], dp[j]);
        }
    }

    vector<int> suf(n + 1);
    multiset<int> pr;
    int sum = 0;
    for (int i = n - 1; i >= 0; --i) {
        pr.insert(arr[i][1]);
        sum += arr[i][1];
        if ((int)pr.size() > k) {
            sum -= *pr.begin();
            pr.erase(pr.begin());
        }
        suf[i] = sum;
    }
    int ans = 0;
    for (int i = 0; i <= n; ++i) {
        ans = max(ans, pref[i] + suf[i]);
    }
    cout << ans << "\n";

    return 0;
}