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

pair<int,int> objects[5010];
long long dp[5010][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,objects+N);

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