#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back
#define MAX 3005

int n,t,s;
pair<int,int> a[MAX];
#define fi first
#define se second

void nhap()
{
    cin >> n >> t >> s;
}

void sub1()
{
    for(int i = 0; i<n; i++) cin >> a[i].fi >> a[i].se;
    ll ans = 0;
    for(int mask = 0; mask < (1<<n); mask++){
        int check = 0;
        ll sum = 0;
        for(int tmp = mask; tmp >0; tmp &= (tmp-1)){
            int i = __builtin_ctz(tmp);
            if(check < s && s < check + a[i].se) check = s;
            check += a[i].se;
            sum += a[i].fi;
        }
        if(check <= t) ans = max(ans, sum);
    }
    cout << ans;
}

void sub2()
{
    for(int i = 1; i<=n; i++) cin >> a[i].fi >> a[i].se;
    vector<vector<ll> > dp(n+1,vector<ll>(t+1,0));
    for(int i = 1; i<=n; i++){
        for(int j = 0; j<=t; j++){
            dp[i][j] = max(dp[i][j], dp[i-1][j]);
            if(j >= a[i].se){
                dp[i][j] = max(dp[i][j], dp[i-1][j - a[i].se] + a[i].fi);
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i<=t; i++) ans = max(ans, dp[n][i]);
    cout << ans;
}

void sub3()
{
    for(int i = 1; i<=n; i++) cin >> a[i].fi >> a[i].se;
    vector<vector<ll> > dp(n+1, vector<ll>(t+1,0));
    for(int i = 1; i<=n; i++){
        for(int j = 0; j<=t; j++){
            dp[i][j] = max(dp[i][j], dp[i-1][j]);
            if(j >= a[i].se){
                ll prev = j - a[i].se;
                if(prev < s && s < j) continue;
                dp[i][j] = max(dp[i][j], dp[i-1][j-a[i].se] + a[i].fi);
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i<=t; i++) ans = max(ans, dp[n][i]);
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    freopen("SPACE.INP","r",stdin);
    freopen("SPACE.OUT","w",stdout);
    nhap();
    if(n <= 20){
        sub1();
        return 0;
    }
    if(s == 0){
        sub2();
        return 0;
    }
    sub3();
    return 0;
}