#include <iostream>
#include <fstream>
using namespace std;

int a[5001][10001], p[10001], w[10001];

int main(){
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    int n, g, wmax = 0;
    fin>>n>>g;
    for(int i = 1; i <= n; i++){
        fin>>w[i]>>p[i];
        wmax += w[i];
    }

    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= g; j++){
            a[i][j] = a[i-1][j];
            if(w[i] <= j)
                a[i][j] = max(a[i][j], a[i-1][j-w[i]] + p[i]);
        }
    }

    fout<<a[n][g];


    fin.close();
    fout.close();
    return 0;
}