0/1 knapsack(dp solution)

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll n, w;
const ll mx = 1e5 + 5;
ll dp[105][mx];
ll weight[105], price[105];
ll solve(ll i, ll cur_wg) {
  if (i > n) {
    return 0;
  }
  if (dp[i][cur_wg] != -1) {
    return dp[i][cur_wg];
  }
  ll res1 = 0, res2 = 0;
  res1 = solve(i + 1, cur_wg);
  if (cur_wg + weight[i] <= w) {
    res2 = price[i] + solve(i + 1, cur_wg + weight[i]);
  }
  return dp[i][cur_wg] = max(res1, res2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> w;
  for (ll i = 1; i <= n; i++) {
    cin >> weight[i] >> price[i];
  }
  cout << solve(1, 0) << "\n";
  return 0;
}