#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
const int Gmax = 10005;
const int Nmax = 5005;
int a[Nmax] , g[Nmax] , G , dp[2][Gmax] , n;
int main()
{
    int lin , cmax;
    fin >> n >> G;
    for(int i = 1 ; i <= n ; i++)
        fin >> g[i] >> a[i];
    lin = 0;
    dp[lin][g[1]] = a[1];
    for(int i = 2 ; i <= n ; i++)
    {
        lin = 1 - lin;
        for(int j = 1 ; j <= G ; j++)
        {
            dp[lin][j] = dp[1 - lin][j];
            if(j >= g[i])
                dp[lin][j] = max(dp[lin][j] , dp[1 - lin][j - g[i]] + a[i]);
        }
    }
    cmax = 0;
    for(int i = 1 ; i <= G ; i++)
        cmax = max(cmax , dp[lin][i]);
    fout << cmax << "\n";
    fin.close();
    fout.close();
    return 0;
}