#include<bits/stdc++.h>
const int N = 1e4+5;
using i64 = long long;
std::priority_queue<int, std::vector<int>, std::greater<int>> q;
int n, w, k; i64 ans, f[2][N], suf[N];
#define fi first 
#define se second
std::pair<int,int> o[N];
signed main() {
    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
    scanf("%d%d%d", &n, &w, &k);
    for(int i = 1; i <= n; ++i) scanf("%d%d", &o[i].fi, &o[i].se);
    std::sort(o + 1, o + n + 1);
    memset(f, 0xcf, sizeof f);
    f[0][0] = 0;
    if(n <= k) {
        for(int i = 1; i <= n; ++i) ans += o[i].se;
        printf("%lld\n", ans);
        return 0;
    }
    i64 num = 0;
    for(int i = n; i > n - k; --i) suf[i] = num, q.push(o[i].se), num += o[i].se;
    for(int i = n - k; i; --i) {
        suf[i] = num;
        num += o[i].se, q.push(o[i].se);
        num -= q.top(), q.pop();
    }
    ans = suf[0] = num;
    for(int i = 1; i <= n; ++i) {
        i64 ss = 0;
        //for(int j = 0; j <= w; ++j) f[i & 1][j] = 0;
        //for(int j = 0; j < o[i].fi; ++j) f[i & 1][j] = f[(i - 1) & 1][j];
        for(int j = o[i].fi; j <= w; ++j) {
            f[i & 1][j] = std::max(f[(i - 1) & 1][j], f[(i - 1) & 1][j - o[i].fi] + o[i].se);
        }
        for(int j = 0; j <= w; ++j) ss = std::max(ss, f[i & 1][j]);
        ans = std::max(ans, ss + suf[i]);
    }
    printf("%lld\n", ans);
    return 0;
}