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

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

int n,g;
int w[10005],p[10005];
int a[2][10005];

int main()
{
    fin>>n>>g;
    for(int i=1;i<=n;i++){
        fin>>w[i]>>p[i];
    }
    int l1,l2;

    l1=0;
    l2=1;

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