#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,D[5001][10001],p[5001],w[5001];
int main()
{
    in>>n>>g;
    for(int i=1;i<=n;++i)in>>w[i]>>p[i];
    for(int i=1;i<=n;++i)
    {
        for(int cw=1;cw<=g;++cw)
        {
            D[i][cw]=D[i-1][cw];
            if(w[i]<=cw)
            {
                D[i][cw]=max(D[i][cw],D[i-1][cw-w[i]]+p[i]);
            }
        }
    }
    for(int i=1;i<=n;++i)
    {
        for(int cw=1;cw<=g;++cw)
        {
            cout<<D[i][cw]<<" ";
        }
        cout<<endl;
    }
    out<<D[n][g];
    return 0;
}