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

ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,k,g[10005],p[10005],i,j,d[2][10005];

int main()
{
    in>>n>>k;
    for(int i=1;i<=n;++i){
        in>>g[i]>>p[i];
    }
    int l=0;
    for(i=1;i<=n;++i, l=1-l){
        for(int j=0 ;j<=k;++j){
            d[1-l][j]=d[l][j];
            if(g[i]<=j) d[1-l][j]=max(d[ 1-l ][ j ],(d[ l ][ j-g[i]] + p[i] ));

        }
    }
    out<<d[l][k];
    return 0;
}