#include<bits/stdc++.h>
using namespace std;
const int INF=1e9;
#define int long long
signed main(){
  int n, m, k; cin >> n >> m >> k;
    vector<int>w(n + 2), v(n + 2, 0);
    for (int i = 1; i <= n; i++)cin >> w[i] >> v[i];
    vector<vector<vector<int>>>dp(n + 1, vector<vector<int>>(m + 2, vector<int>(k + 1, -INF)));
    dp[0][0][0] = 0;
    int ret = 0;
    for(int i = 1; i <= n; i++)
        for (int j = 0; j <= m; j++) {
            for (int p = 0; p <= k; p++) {
                dp[i][j][p] = dp[i - 1][j][p];
                if (j >= w[i])dp[i][j][p] = max(dp[i][j][p], dp[i - 1][j - w[i]][p] + v[i]);
                if (p)dp[i][j][p] = max(dp[i][j][p], dp[i - 1][j][p - 1] + v[i]);
                ret = max(ret, dp[i][j][p]);
                //cout << i << ' ' << j << ' ' << p << ' ' << dp[i][j][p] << endl;
            }
        }
    cout << ret << endl;
    //cout << dp[n][m][k] << endl;
}