#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, W, k;
  cin >> n >> W >> k;

  vector<int64_t> dp(W + 1);
  vector<pair<int,int>> items(n);
  for (auto &[w, v] : items) {
    cin >> w >> v;
  }
  ranges::sort(items);

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

  auto ans = dp[W];

  min_heap<int> pq;
  int64_t sum = 0;
  for (int i = n - 1; i >= 0; i--) {
    pq.push(items[i].second);
    sum += items[i].second;
    while (pq.size() > k) {
      sum -= pq.top();
      pq.pop();
    }

    ans = max(ans, val[i] + sum);
  }
  cout << ans << '\n';

  return 0;
}