#include <bits/stdc++.h>

using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int w[1001],p[1001],a[2][10005];
int main()
{int n,g,i,j,c,Pmax;
fin>>n>>g;
j=0;
Pmax=0;
for(i=1;i<=n;i++){
    fin>>w[i]>>p[i];}
bool k=0;
for(i=1;i<=n;i++){
    for(j=1;j<=g;j++){
      a[k][j]=a[1-k][j];
        if(w[i]<=j){
            a[k][j]=max(a[1-k][j],a[1-k][j-w[i]]+p[i]);}}
            k=1-k;}
            fout<<a[1-k][g];
    return 0;
}