#include <bits/stdc++.h>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");

pair<long long, long long> objects[5010];
long long dp[3][10010];
int N, G;

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

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

    for(int i = 1; i <= N; ++i)
    {
        for(int j = 1; j <= G; ++j)
            dp[2][j] = max(objects[i].second + dp[1][j - objects[i].first], dp[1][j]);

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

    fo<<dp[2][G];
}