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

int dp[105][105];

int main()
{
	int n,G,greutate,profit;
	freopen("rucsac.in","r", stdin);
	scanf("%d %d",&n,&G);
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d",&greutate,&profit);
		for(int g=0;g<=G;g++)
		{
			dp[i][g]=dp[i-1][g];
			if(greutate<=g)
				dp[i][g]=max(dp[i][g],dp[i][g-greutate]+profit);
			for(int j=1;j<=n;j++)
			{
				cout<<endl;
				for(int k=1;k<=G;k++)
					cout<<dp[j][k]<<" ";
			}
			cout<<endl;
		}
	}

	return 0;
}