#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
int v[5005];
int w[5005];
int dp[5005][10001];
void solve()
{
    int n, m;
    int k;
    cin >> n >> m >> k;

    for (int i = 1; i <= n; i++)
    {
        cin >> v[i] >> w[i];
    }
    // for (int i = 0; i <= n; i++)
    // {
    //     for (int j = 0; j <= m; j++)
    //     {
    //         dp[i][j] = INF;
    //     }
    // }
    dp[0][0] = 0;
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (j >= v[i])
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
            else
            {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    for (int i = 1; i <= m; i++)
    {
        ans = max(ans, 1LL * dp[n][i]);
    }
    // cout << ans << '\n';
    int last = m;
    vector<int> vis(n + 1, 0);
    for (int i = n; i >= 1; i--)
    {
        if (i == 1)
        {
            if (last >= v[i])
                vis[i] = 1;
            break;
        }
        if (dp[i - 1][last - v[i]] + w[i] == dp[i][last])
        {
            vis[i] = 1;
            last -= v[i];
        }
    }
    priority_queue<int> q;
    for (int i = 1; i <= n; i++)
    {
        if (vis[i] == 0)
        {
            q.push(w[i]);
        }
    }
    while (k-- && q.size() > 0)
    {
        ans += q.top();
        q.pop();
    }
    cout << ans << '\n';
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}