#include<cstdio>
#include<algorithm>
using namespace std;

int w[5005],p[5005],a[2][10005];

int main ()
{
    int n,g,i,j,l=0;
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d%d",&n,&g);
    for (i=1; i<=n; i++)
        scanf("%d%d",&w[i],&p[i]);
    for (i=1; i<=n; i++, l=1-l)
    {
        for (j=0; j<=g; j++)
        {
            a[l][j]=a[1-l][j];
            if (j>=w[i]) a[l][j]=max(a[l][j],a[1-l][j-w[i]]+p[i]);
            printf("%d ",a[l][j]);
        }
        printf("\n");
    }
    printf("%d\n",a[1-l][g]);
    return 0;
}