#include<bits/stdc++.h>
using namespace std;
int max(int a, int b)
{
    return (a > b) ? a : b;
}
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int ruc(int W, int wt[], int val[], int n)
{
    int i, w;
    int K[n + 1][W + 1];
 
    for (i = 0; i <= n; i++)
    {
        for (w = 0; w <= W; w++)
        {
            if (i == 0 || w == 0)
                K[i][w] = 0;
            else if (wt[i - 1] <= w)
                K[i][w]
                        = max(val[i - 1] + K[i - 1][w - wt[i - 1]], K[i - 1][w]);
            else
                K[i][w] = K[i - 1][w];
        }
    }
 
    return K[n][W];
}
 
int main()
{
    int n, W;
    f >> n;
    f>>W;
    int val[10020], wt[10020];
    for (int i = 0; i < n; i++)
    {
        f>> wt[i];
        f>> val[i];
    }
    g << ruc(W, wt, val, n);
   
    return 0;
}