#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>

///#include <tryhardmode>
///#include <GOMDODE::ON>

using namespace std;

#define cin fin
#define cout fout

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

const int INF=-2e9;
const int NMAX=5e3+5;
const int MAXG=1e4+5;

long long dp[MAXG];

struct elem{
    int g;
    int val;
}v[NMAX];

int main()
{
    int n,m,i,j,greu;
    long long maxim=0;
    cin>>n>>greu;
    for(i=1;i<=greu;i++)
        dp[i]=INF;
    dp[0]=0;
    for(i=1;i<=n;i++)
        cin>>v[i].g>>v[i].val;
    for(i=1;i<=n;i++)
    {
        for(j=greu;j>=0;j--)
        {
            if(j+v[i].g>greu || dp[j]==INF)
                continue;
            else
            {
                if(dp[j+v[i].g]<v[i].val+dp[j])
                {
                    dp[j+v[i].g]=v[i].val+dp[j];
                    maxim=max(maxim,dp[j+v[i].g]);
                }
            }
        }
    }
    cout<<maxim;
    return 0;
}