#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define forA(V) for (aut(it,(V).begin());it!=(V).end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
int D[2][10005],i,j,N,G,v[5005],w[5005],p;
int main()
{
    freopen("ruscac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d %d",&N,&G);
    for (i=1;i<=N;i++) scanf("%d %d",&w[i],&v[i]);
    for (i=1;i<=N;i++,p=1-p)
        for (j=0;j<=G;j++)
            if (j>=w[i]) D[1-p][j]=max(D[p][j-w[i]]+v[i],D[p][j]);
            else D[1-p][j]=D[p][j];
    printf("%d",D[p][G]);
    return 0;
}