#include <bits/stdc++.h>
using i64 = long long;

void solve() {
    int n, W, k;
    std::cin >> n >> W >> k;
    std::vector dp(2, std::vector(n + 1, std::vector<i64>(W + 1)));
    std::vector lst(2, std::vector(n + 1, std::vector<std::array<int, 3>>(W + 1)));
    std::vector<std::pair<i64, i64>> v(n + 1);
    for(int i = 1; i <= n; ++i) {
        auto &[cost, val] = v[i];
        std::cin >> cost >> val;
        for(int j = 0; j <= W; ++j) {
            if(dp[0][i - 1][j] > dp[0][i][j]) {
                dp[0][i][j] = dp[0][i - 1][j];
                lst[0][i][j] = {0, i - 1, j};
            }
            if(dp[1][i - 1][j] > dp[0][i][j]) {
                dp[0][i][j] = dp[1][i - 1][j];
                lst[0][i][j] = {1, i - 1, j};
            }
        }
        for(int j = cost; j <= W; ++j) {
            if(dp[0][i - 1][j - cost] + val > dp[1][i][j]) {
                dp[1][i][j] = dp[0][i - 1][j - cost] + val;
                lst[1][i][j] = {0, i - 1, j - cost};
            }
            if(dp[1][i - 1][j - cost] + val > dp[1][i][j]) {
                dp[1][i][j] = dp[1][i - 1][j - cost] + val;
                lst[1][i][j] = {1, i - 1, j - cost};
            }
        }
    }
    std::array<int, 3> now = {(dp[1][n][W] > dp[0][n][W]), n, W};
    std::vector<int> vis(n + 1);
    while(now != std::array<int, 3>{0, 0, 0}) {
        auto [i, j, k] = now;
        if(i == 1) {
            vis[j] = 1;
        }
        now = lst[i][j][k];
    }
    std::vector<std::pair<i64, i64>> vec;
    for(int i = 1; i <= n; ++i) {
        if(vis[i]) continue;
        vec.push_back(v[i]);
    }
    std::sort(vec.begin(), vec.end(), 
    [&](auto a, auto b) ->bool {
        return a.second > b.second;
    });
    i64 ans = std::max(dp[0][n][W], dp[1][n][W]);
    for(int i = 0; i < vec.size() && i < k; ++i) {
        ans += vec[i].second;
    }
    std::cout << ans << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    //std::cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}