#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, G;
int a[5005], p[5005], dp[10005];

int main()
{
    int i, j;
    fin >> n >> G;
    for (i = 1; i <= n; i++)
        fin >> a[i] >> p[i];
    for (i = 1; i <= n; i++)
    {
        for (j = G - a[i]; j >= 0; j--)
            if (dp[j] > 0)dp[j + a[i]] = max(dp[j + a[i]], dp[j] + p[i]);
        dp[a[i]] = max(dp[a[i]], p[i]);
    }
    int Max = 0;
    for (i = 1; i <= G; i++)
        Max = max(Max, dp[i]);
    fout << Max;
    return 0;
}