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

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

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

    for(int i = 1; i <= n; i++)
        a[i] = -1;

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

    fout<<a[g];


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