#include <iostream>
#include <fstream>
#define N_MAX 5000
#define G_MAX 10000

using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");

int P[N_MAX][G_MAX], w[N_MAX], p[N_MAX], N, G;

int main()
{
    in >> N >> G;
    for(int i = 1; i <= N; i++)
        in >> w[i] >> p[i];

    for(int i = 1; i <= G; i++)
        if(w[1] <= i) P[1][i] = p[1];
    for(int i = 2; i <= N; i++)
        for(int j = 0; j <= G; j++)
        {
            if(p[i] + P[i-1][j] >= P[i-1][w[i] + j]) P[i][w[i] + j] = p[i] + P[i-1][j];
            else P[i][w[i] + j] = P[i-1][w[i] + j];

            if(P[i][j] < P[i-1][j]) P[i][j] = P[i-1][j];
        }
    for(int i = 1; i <= N; i++)
    {
        for(int j = 0; j <= G; j++)
            out << P[i][j] << " ";
        out << endl;
    }
    cout << P[N][G];
    return 0;
}