#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");

int N, G;
pair<int, int> items[5005];
int dp[3][10005];

int main()
{
    fi >> N >> G;
    for(int i = 1; i <= N; ++i)
        fi >> items[i].first >> items[i].second;

    sort(items + 1, items + N + 1);

    for(int i = 1; i <= N; ++i)
    {
        for(int j = 1; j <= G; ++j)
        {
            if(j - items[i].first >= 0)
                dp[2][j] = max(dp[1][j], dp[1][ j - items[i].first] + items[i].second);
            else
                dp[2][j] = dp[1][j];
        }

        for(int j = 1; j <= G; ++j)
            dp[1][j] = dp[2][j];
    }
    fo << dp[2][G];
}