#include <fstream>
#include <iostream>
using namespace std;

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

typedef long long ll;
int v[5005], g[5005], n, G, dp[2][10001];
void Solve ()
{
    int lin, M;
    fin >> n >> G;
    for (int i = 1; i <= n; i++)
        fin >> g[i] >> v[i];
    lin = 0;
    for (int i = 1; i <= n; i++)
    {
        lin = 1 - lin;
        for (int j = 1; j <= G; j++)
        {
            M = dp[1 - lin][j];
            if (j >= g[i] && M < dp[1 - lin][j - g[i]] + v[i])
                M = dp[1 - lin][j - g[i]] + v[i];
            dp[lin][j] = M;
        }
    }
    int ans = 0;
    for (int i = 1; i <= G; i++)
        ans = max(ans, dp[lin][i]);
    fout << ans;
}

int main()
{
    Solve();
    return 0;
}