#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;
ll dp[2][10001];
ll f[5005], maxsum[5005], top, maxnn, maxn[5005];

struct Node
{
    ll w, v;
} a[5005];

bool cmp(Node a, Node b)
{
    return a.v < b.v;
}
bool cmp2(ll a, ll b)
{
    return a > b;
}
ll max(ll a, ll b) { return a > b ? a : b; }

void solve()
{
    int n, m;
    int k;
    cin >> n >> m >> k;

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].v >> a[i].w;
    }
    // for (int i = 0; i <= n; i++)
    // {
    //     for (int j = 0; j <= m; j++)
    //     {
    //         dp[i][j] = INF;
    //     }
    // }
    sort(a + 1, a + n + 1, cmp);
    top = 0;
    maxsum[n + 1] = 0;
    for (int i = n; i > n - k; i--)
    {
        f[n - i + 1] = a[i].w;
        maxsum[i] = maxsum[i + 1] + a[i].w;
    }
    sort(f + 1, f + k + 1, cmp2);
    for (int i = n - k; i > 0; i--)
    {
        if (f[k] >= a[i].w)
            continue;
        maxsum[i] = maxsum[i + 1] + a[i].w - f[k];
        ll o = k;
        while (o > 0 && f[o] < a[i].w)
        {
            f[o + 1] = f[o];
            o--;
        }
        f[o + 1] = a[i].w;
    }
    dp[0][0] = 0;
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (j >= a[i].v)
                dp[i % 2][j] = max(dp[1 - i % 2][j], dp[1 - i % 2][j - a[i].v] + a[i].w);
            else
            {
                dp[i % 2][j] = dp[1 - i % 2][j];
            }
            maxn[i] = max(maxn[i], dp[i % 2][j]);
        }
        maxnn = max(maxnn, maxn[i] + maxsum[i + 1]);
    }
    maxnn = max(maxnn, maxsum[1]);
    cout << maxnn << '\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;
}