// Infoarena - Arhiva Educationala rucsac
// Februrie 2012 Marius Dumitran
// Programare dinamica clasica timp O(N*G) memorie O(G)

#include<string.h>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include <iostream>
#define maxn 5001
#define maxg 10001

using namespace std;

int W[maxn], P[maxn];
int Optim[maxg];

int main() {
int sol=0,pwd=0;
    //freopen("rucsac.in", "r", stdin);
    freopen("energii.in", "r", stdin);
    //freopen("rucsac.out", "w", stdout);
    freopen("energii.out", "w", stdout);
    int N, G;
    scanf("%d %d", &N, &G);

    for (int i = 1; i <= N; ++i) {
        scanf("%d %d", &W[i], &P[i]);
        sol+=P[i];
        pwd+=W[i];
    }

    Optim[0] = 0;
//    int sol = ;


    for( int i = 1; i <= N; ++i)
        for( int j = G-W[i]; j>=0; --j) {
            //if( Optim[j+W[i]] < Optim[j] + P[i] )
            //printf("%d %d %d \n", i, j, Optim[j]);
            if( Optim[j+W[i]] < Optim[j] + P[i] )
            {
              //printf("%d %d %d %d %d %d \n", i, j , j+W[i],Optim[j], Optim[j+W[i]],Optim[j] + P[i]);
                Optim[j+W[i]] = Optim[j] + P[i];
                //if( Optim[j+W[i]] > sol)
                if( Optim[j+W[i]] < sol && Optim[j+W[i]]>=G)
                {
                    sol = Optim[j+W[i]];
                    //printf("%d \n", sol);
                }
            }
        }

    printf("%d", sol);

    return 0;
}