int b[15][15] = { 0 }, a[15][15] = { 0 }, n = 0;
void f(int t)
{
	if (t == n+1)
	{
		for (int i = 1; i <= 9; i++)
		{
			for (int k = 1; k <= 8; k++)
			{
				cout << a[i][k] << " ";
			}
			cout << a[i][9] << endl;
		}
	}
	else
	{
		memset(b, 0, sizeof(b));
		for (int j = 1; j <= 9; j++)
		{
			for (int k = 1; k <= 9; k++)
			{
				if (a[j][k] != 0)
				{
					for (int p = j - 1; p <= j + 1; p++)
					{
						for (int q = k - 1; q <= k + 1; q++)
						{
							b[p][q] += a[j][k];
						}
					}
					b[j][k] += a[j][k];
				}
			}
		}
		for (int j = 1; j <= 9; j++)
		{
			for (int k = 1; k <= 9; k++)
			{
				a[j][k] = b[j][k];
			}
		}
		f(t + 1);
	}
}
int main()
{

	int m = 0;
	cin >> m >> n;
	a[5][5] = m;
        f( 1 );
	return 0;
}