#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int uplg(int n) { return 32-__builtin_clz(n); }
int uplg(ll n)  { return 64-__builtin_clzll(n); }

constexpr int MOD = 167772161;

ll modPow(ll a, ll e, ll m) {
	ll t = 1 % m;
	while (e) {
		if (e % 2) t = t*a % m;
		e /= 2; a = a*a % m;
	}
	return t;
}

struct Zp {
	ll x;
	Zp() : x(0) {}
	Zp(ll a) : x(a%MOD) { if (x < 0) x += MOD; }
	#define OP(c,d) Zp& operator c##=(Zp r) { x = x d; return *this; } Zp operator c(Zp r) const { Zp t = *this; return t c##= r; }
	OP(+, +r.x - MOD*(x+r.x >= MOD));
	OP(-, -r.x + MOD*(x-r.x < 0));
	OP(*, *r.x % MOD);
	OP(/, *r.inv().x % MOD);
	Zp inv() const { return pow(MOD-2); }
	Zp pow(ll e) const{ return modPow(x,e,MOD); }
	void print() { cerr << x; }
};

constexpr int MX = 405;
using mat = array<array<Zp, MX>, MX>;

int n, k;
Vi elems;
vector<vector<Zp>> ans;

void add(mat& dp, int elem) {
	for (int i = n; i >= 1; i--) {
		for (int j = k; j >= elem; j--) {
			dp[i][j] += dp[i-1][j-elem];
		}
	}
}

void solve(mat& dp, int b, int e) {
	if (e-b == 1) {
		rep(i, 1, n) {
			rep(j, 0, k+1) {
				if (j+elems[b] > k) {
					ans[b][i-1] += dp[i][j];
				}
			}
		}
		return;
	}

	int m = (b+e) / 2;
	mat cp = dp;
	rep(i, b, m) add(cp, elems[i]);
	solve(cp, m, e);
	cp = dp;
	rep(i, m, e) add(cp, elems[i]);
	solve(cp, b, m);
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(18);

	cin >> n >> k;
	elems.resize(n);
	each(e, elems) cin >> e;

	mat dp;
	rep(i, 0, MX) rep(j, 0, MX) dp[i][j] = 0;
	dp[0][0] = 1;

	ans.resize(n, vector<Zp>(n-1));
	solve(dp, 0, n);

	each(row, ans) {
		each(a, row) cout << a.x << ' ';
		cout << '\n';
	}
	return 0;
}