/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2022.05.20 22:52:30
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;


int main() {
    int n,V,C;cin >> n >> V >> C;
    vector<vector<vector<ll>>> dp(n+1,vector<vector<ll>>(V+1,vector<ll>(2)));
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        int v,w;cin >> v >> w;
        for (int j = 0; j <= V; j++) {
            dp[i+1][j][0] = max(dp[i][j][0],dp[i][j][1]);
            if (j>=v) dp[i+1][j][1] = max(dp[i+1][j-v][0]+C+w,dp[i+1][j-v][1]+w);
            ans = max(dp[i+1][j][0],dp[i+1][j][1]);
        }
    }
    cout << ans << endl;
    return 0;
}