#include <iostream>
#include <fstream>
//#define MAX_SIZE1 500
//#define MAX_SIZE2 1000
#define max(a,b) a > b? a : b
using namespace std;
int main()
{
//    int n, v[MAX_SIZE1],w[MAX_SIZE2],W,dp[MAX_SIZE1][MAX_SIZE2];
    int n,*v,*w,**dp,W;
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> n >> W;
    v = new int[n + 1];
    w = new int[W + 1];
    dp = new int*[n + 1];
    for (int i = 0;i < n + 1;i++) {
        dp[i] = new int[W + 1];
    }
    for (int i = 0;i < n;i++) {
        fin >> w[i] >> v[i];
    }
    for (int i = 0;i < n + 1;i++) {
        for (int j = 0;j < W + 1;j++) {
            if(i == 0 || j == 0) dp[i][j] = 0;
            else if (j >= w[i-1]) dp[i][j] = max(dp[i-1][j], v[i-1] + dp[i-1][j - w[i - 1]]);
            else dp[i][j] = dp[i-1][j];
        }
    }
    //parcurg normal si initializez cu 0 matricea
    fout << dp[n][W] << endl;
//    for (int i = 0;i < n + 1;i++) {
//        for (int j = 0;j < W + 1;j++) {
//            cout <<dp[i][j] <<  ' ';
//        }
//        cout << endl;
//    }
    fin.close();
    fout.close();
}