#include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <complex>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll              long long
#define pi              pair<int,int>
#define pll             pair<ll,ll>
#define pb              push_back
#define F               first
#define S               second
#define vi              vector<int>
#define vll             vector<ll>
#define endl            '\n'
#define all(v)          (v).begin(),(v).end()
#define FOR(i,a,b)      for(int i=a;i<b;i++)
#define MP(a,b)         make_pair(a,b)
#define debug(x)        cerr<< #x << " : " << x << endl;
#define debugp(p)       cerr<< #p << " : " << "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v)       cerr<< #v << " : " << "["; for(int i = 0; i < (v).size(); i++) cerr << v[i] << " "; cerr<<"]\n";
#define debugs(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<*itr << " "; cerr << "]\n";
#define debugm(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<"(" << itr->first << "," << itr->second << ") "; cerr << "]\n";

/* ordered set: 
tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>
member functions :
1. order_of_key(k) : number of elements strictly lesser than k
2. find_by_order(k) : k-th element in the set
*/

inline ll modexp(ll x, ll ex , ll md) {
    ll ans = 1ll;
    while (ex > 0) {
        if (ex & 1ll) ans = (ans * x) % md;
        ex >>= 1ll;
        x = (x * x) % md;
    }
    return ans;
}

const int inf = 1e9 + 7;

void solve(){
  int n , W;
  cin >> n >> W;

  /*
    dp[i][w] is the maximum possible value obtained upto position i given that we have taken
    weights exactly w
    if we take next element we go to dp[i + 1][w + w[i]] --> dp[i][w] + v[i+1]
    if we dont take we go to dp[i + 1][w]--> dp[i][w]
    or 
    dp[i][w] = max(v[i]+dp[i-1][w-w[i]],dp[i-1][w])
  */

  // space optimized version
  /*
     for each i dp denotes the maximum value sum that can be obtained upto this position
     so ultimately dp will have our answer
  */
  vector<ll> dp(W + 1); // so this is the empty knapsack initially
  for (int i = 0; i < n; i++){
    int weight;
    ll value;
    cin >> weight >> value;
    // update the knapsack for this i
    vector<ll> new_dp (W + 1);
    for (int wt = 0; wt <= W; wt++){
      // if we don't take this we remain in this state
      new_dp[wt] = max (dp[wt] , new_dp[wt]);
      // we take the current value and move to other state
      if (wt + weight <= W)
        new_dp[wt + weight] = max (new_dp[wt + weight] , dp[wt] + value);
    }
    swap (new_dp , dp);
  }
  ll ans = 0;
  for (int wt = 0; wt <= W; wt++){
    ans = max (ans , dp[wt]);
  }
  cout << ans << endl;
}
int main(){
    ios :: sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr);
    
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; tc++){
        // cout << "Case #" << tc << ": ";
        solve();
    }
    #ifdef LOCAL
    cerr << "Time elapsed\t: " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";       
    #endif
}



Measured memory_bytes: 4720