#include <bits/stdc++.h>
using namespace std;
ifstream f ("rucsac.in") ;
ofstream g ("rucsac.out") ;
int N , GMAX , W[5005] , P[5005] , dp[5005][10005] ;
int main()
{
    f >> N >> GMAX ;
    for (int i = 1 ; i <= N ; ++i)
        f >> W[i] >> P[i];
    for (int i = 1 ; i <= N ; ++i)
    for (int j = 1 ; j <= GMAX ; ++j)
    {
        if (j >= W[i])
            dp[i][j] = max(dp[i-1][j] , dp[i-1][j-W[i]] + P[i]) ;
        else dp[i][j] = dp[i-1][j] ;
    }
    g << dp[N][GMAX] << '\n';
    f.close();
    g.close();
    return 0 ;
}