#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll dp[5555][5555][2];
void Main() {
  ll n,m,c;
  cin >> n >> m >> c;
  ll a[n],b[n];
  rep(i,n) cin >> a[i] >> b[i];
  rep(i,n+1)rep(j,m+1)rep(k,2) dp[i][j][k]=-MAXL;
  dp[0][0][0]=0;
  REP(i,1,n+1) {
    rep(j,m+1) {
      dp[i][j][0]=max(dp[i][j][0],dp[i-1][j][0]);
      dp[i][j][0]=max(dp[i][j][0],dp[i-1][j][1]);
      if(j+a[i-1]<=m) {
        dp[i][j+a[i-1]][0]=max(dp[i][j+a[i-1]][0],dp[i-1][j][0]+b[i-1]+c);
        dp[i][j+a[i-1]][0]=max(dp[i][j+a[i-1]][0],dp[i-1][j][1]+b[i-1]+c);
        dp[i][j+a[i-1]][1]=max(dp[i][j+a[i-1]][1],dp[i][j][0]+b[i-1]);
        dp[i][j+a[i-1]][1]=max(dp[i][j+a[i-1]][1],dp[i][j][1]+b[i-1]);
      }
    }
  }
  ll ans=0;
  rep(i,m+1) ans=max(ans,max(dp[n][i][0],dp[n][i][1]));
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}