#include <bits/stdc++.h>
#define N 5001
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int main(){
    int n, g, w[N], p[N], rez[2*N], solv = 0;
    fin>>n>>g;
    for(int i=1;i<=n;i++){
        fin>>w[i]>>p[i];
    }
    for(int i=1;i<=n;i++){
        for(int j=g-w[i];j>=0;j--){
            if(rez[j+w[i]]<rez[j] + p[i]){
                rez[j+w[i]] = rez[j] + p[i];
                solv = max(rez[j+w[i]], solv);
            }
        }
    }
    fout<<solv;
    return 0;
}