#include #include using namespace atcoder; #define rep(i, n) for(ll i = 0; i < n; i++) #define rep2(i, m, n) for(ll i = m; i <= n; i++) #define rrep(i, m, n) for(ll i = m; i >= n; i--) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define MAX(x) *max_element(all(x)) #define MIN(x) *min_element(all(x)) #define SZ(a) ((ll)(a).size()) #define bit(n, k) ((n >> k) & 1) using namespace std; using ll = long long; using P = pair; const int dx[4] = { -1, 1, 0, 0 }; const int dy[4] = { 0, 0, 1, -1 }; const int inf = 1e9 + 1; const ll INF = 1e18; const double pi = acos(-1); using Graph = vector>; using REV_PQ = priority_queue, greater>; using PQ = priority_queue; //typedef atcoder::modint998244353 mint; //typedef atcoder::modint1000000007 mint; const int SIZE = 200010; ll powll(ll n, ll x) { // return n ^ x; ll ret = 1; rep(i, x) ret *= n; return ret; } /*struct Edge { ll u, v, cost; }; bool comp(const Edge& e1, const Edge& e2) { return e1.cost < e2.cost; }*/ void OutputYesNo(bool val) { if (val) cout << "Yes" << endl; else cout << "No" << endl; } void OutputTakahashiAoki(bool val) { if (val) cout << "Takahashi" << endl; else cout << "Aoki" << endl; } void OutPutInteger(ll x) { cout << x << endl; } void OutPutString(string x) { cout << x << endl; } /* int t; cin >> t; rep2(i, 1, t){ cout << "Case #" << i << ":" << endl; cout << "Case #" << x << ":" << " "; } */ ll dp[5010][5010]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n, v, c; cin >> n >> v >> c; vector V(2 * n), W(2 * n); rep(i, n) cin >> V[n + i] >> W[n + i]; rep2(i, n, 2 * n - 1) V[i - n] = V[i]; rep2(i, n, 2 * n - 1) W[i - n] = W[i] + c; rep(i, n)rep2(j, 0, v) { if (j < V[i]) { dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]); } else { dp[i + 1][j] = max(dp[i][j], dp[i][j - V[i]] + W[i]); } } rep2(i, n, 2 * n - 1)rep2(j, 0, v) { if (j < V[i]) { dp[i + 1][j] = dp[i][j]; } else { dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - V[i]] + W[i]); } } OutPutInteger(dp[2 * n][v]); }