#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

class Knapsack{
  private:
    ll pos;
    ll max_weight;
    vvll dp;
  public:
    Knapsack(ll max_weight){
      this->max_weight = max_weight;
      pos = -1;
      return;
    };

    ~Knapsack(void){
      return;
    };

    void add(ll weight, ll value){
      vll tmp(max_weight+1, 0);
      pos++;
      if(pos==0){
        for(ll i=0; i<min(weight, max_weight+1); ++i){
          tmp[i] = 0;
        }
        for(ll i=weight; i<=max_weight; ++i){
          tmp[i] = value;
        }
        dp.push_back(tmp);
        return;
      }
      for(ll i=0; i<min(weight, max_weight+1); ++i){
        tmp[i] = dp[pos-1][i];
      }
      for(ll i=weight; i<=max_weight; ++i){
        tmp[i] = max(dp[pos-1][i-weight] + value, dp[pos-1][i]);
      }
      dp.push_back(tmp);
      return;
    };

    ll ans(void){
      if(pos==-1) return 0;
      return dp[pos][max_weight];
    };

    void print(void){
      for(int i=0; i<dp.size(); ++i){
        for(int j=0; j<dp[i].size(); ++j){
          printf("%d ", dp[i][j]);
        }
        printf("\n");
      }
      return;
    };
};



int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, W;
  cin >> N >> W;
  Knapsack ks(W);
  REP(i, N){
    ll w, v;
    cin >> w >> v;
    ks.add(w, v);
  }

  cout << ks.ans() << endl;

  return 0;
}

Measured memory_bytes: 79216