#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>

#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

class KnapsackProblem {
    const int num_items;
    const int max_weight;
    std::vector<int> value;
    std::vector<int> weight;

public:
    int max_value = 0;
    std::vector<int> used_item;

    KnapsackProblem(int num_items, int max_weight) : num_items(num_items), max_weight(max_weight) {
        value.resize(num_items);
        weight.resize(num_items);
    }

    void set_value(int idx, int v) {
        this->value[idx] = v;
    }

    void set_weight(int idx, int w) {
        this->weight[idx] = w;
    }

    // 01ナップサック問題
    void solve1() {
        // dp[i][j] = i番目までみたとき、重さjで達成できる価値の最大値
        std::vector<std::vector<int>> dp(num_items + 1, std::vector<int>(max_weight + 1));
        std::vector<std::vector<std::pair<int, int>>> trace(num_items + 1, std::vector<std::pair<int, int>>(max_weight + 1));

        for (int i = 0; i < this->num_items; ++i) {
            const int w = this->weight[i];
            const int v = this->value[i];

            for (int j = 0; j <= this->max_weight; ++j) {
                if (j < this->weight[i]) {
                    dp[i + 1][j] = dp[i][j];
                } else {
                    dp[i + 1][j] = std::max(dp[i][j], dp[i][j - w] + v);
                }
            }
        }

        this->max_value = dp[this->num_items][this->max_weight];
    }

    // 個数制限なしナップサック問題
    void solve2() {
        // dp[i][j] = i番目までみたとき、重さjで達成できる価値の最大値
        std::vector<std::vector<int>> dp(num_items + 1, std::vector<int>(max_weight + 1));
        std::vector<std::vector<std::pair<int, int>>> trace(num_items + 1, std::vector<std::pair<int, int>>(max_weight + 1));

        // 貰うDP
        for(int i = 0; i < num_items; ++i) {
            const int v = this->value[i];
            const int w = this->weight[i];

            for (int j = 0; j <= max_weight; ++j) {
                if (j < w) {
                    dp[i + 1][j] = dp[i][j];
                    trace[i + 1][j] = std::make_pair(i, j);
                } else {
                    if (dp[i][j] < dp[i + 1][j - w] + v) {
                        dp[i + 1][j] = dp[i + 1][j - w] + v;
                        trace[i + 1][j] = std::make_pair(i + 1, j - w);
                    }
                    else {
                        dp[i + 1][j] = dp[i][j];
                        trace[i + 1][j] = std::make_pair(i, j);
                    }
                }
            }
        }

        this->max_value = dp[this->num_items][this->max_weight];

        // get used item idx
        int i = trace[this->num_items][this->max_weight].first;
        int j = trace[this->num_items][this->max_weight].second;
        while (true) {
            auto pre_idx = trace[i][j];
            if (pre_idx.second != j) {
                this->used_item.emplace_back(i - 1);
            }
            i = pre_idx.first;
            j = pre_idx.second;

            if (i == 0 and j == 0) {
                break;
            }
        }
    }
};

using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, W;
    cin >> N >> W;

    KnapsackProblem kp(N, W);
    FOR(i, 0, N) {
        int v, w;
        cin >> v >> w;
        kp.set_value(i, v);
        kp.set_weight(i, w);
    }

    kp.solve1();
    print(kp.max_value);

    return 0;
}



Measured memory_bytes: 14628