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

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

long long n, g, gg, pp;
long long dp[5][10005];
int main()
{
    in >> n >> g;
    for(int i = 1; i <= n; ++i)
    {
        in >> gg >> pp;
        for(int j = 1; j <= g; ++j)
        {
            dp[1][j] = max(dp[1 - 1][j], dp[1][j - 1]);
            if(j >= gg) dp[1][j] = max(dp[1 - 1][j - gg] + pp, dp[1][j]);
        }
        for(int i = 0; i < 2; ++ i)
        {
            for(int j = 1; j <= g; ++j) cout << dp[i][j] << " ";
            cout << '\n';
        }
        for(int j = 1; j <= g; ++ j)
            dp[0][j] = dp[1][j];
        cout << '\n' << '\n';
    }
    out << dp[n][pp];
    return 0;
}