#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// https://github.com/JaroslavUrbann/ICPC-library

typedef long long ll;
typedef long double ld;

const int mod=167772161; // (119<<23)+1
template<int M,int R>
struct modnum{
	int v;
	static int minv(int a,int m){return (a%=m)==1?1:m-ll(minv(m,a))*m/a;}
	static constexpr modnum root(){return R;}
	static constexpr int mod(){return M;}
	modnum():v(0){}
	modnum(ll v_):v(int(v_%M)){if(v<0)v+=M;}
	explicit operator int()const{return v;}
	explicit operator bool()const{return v;}
	friend ostream&operator<<(ostream&out,const modnum&a){return out<<int(a);}
	friend istream&operator>>(istream&in,modnum&a){ll v;in>>v;a=modnum(v);return in;}
	friend bool operator==(const modnum&a,const modnum&b){return a.v==b.v;}
	friend bool operator!=(const modnum&a,const modnum&b){return a.v!=b.v;}
	modnum inv()const{return modnum(minv(v,M));}
	friend modnum inv(const modnum&a){return a.inv();}
	modnum neg()const{return modnum(v?M-v:0);}
	friend modnum neg(const modnum&a){return a.neg();}
	modnum operator-()const{return neg();}
	modnum operator+()const{return *this;}
	modnum&operator++(){if(++v==M)v=0;return*this;}
	modnum&operator--(){if(!v--)v=M-1;return*this;}
	modnum&operator+=(const modnum&a){if((v+=a.v)>=M)v-=M;return*this;}
	modnum&operator-=(const modnum&a){if((v-=a.v)<0)v+=M;return*this;}
	modnum&operator*=(const modnum&a){v=ll(v)*a.v%M;return*this;}
	modnum&operator/=(const modnum&a){return*this*=a.inv();}
	friend modnum operator++(modnum&a,int){modnum r=a;++a;return r;}
	friend modnum operator--(modnum&a,int){modnum r=a;--a;return r;}
	friend modnum operator+(const modnum&a,const modnum&b){return modnum(a)+=b;}
	friend modnum operator-(const modnum&a,const modnum&b){return modnum(a)-=b;}
	friend modnum operator*(const modnum&a,const modnum&b){return modnum(a)*=b;}
	friend modnum operator/(const modnum&a,const modnum&b){return modnum(a)/=b;}
	friend modnum mpow(modnum a,ll b){ // change this to pow and you'll never debug your code
		modnum res=1;
		for(;b;b>>=1,a*=a)if(b&1)res*=a;
		return res;
	}
};
using mint=modnum<mod,3>;

// https://github.com/kth-competitive-programming/kactl/blob/main/content/numerical/NumberTheoreticTransform.h
// multiply pointwise, divide by n, reverse(s+1,e), ntt again
template<class T>
void ntt(vector<T>&a,vector<int>&rev){
	int n=a.size(),L=31-__builtin_clz(n);
	static vector<T>rt(2,1);
	for(static int k=2,s=2;k<n;k*=2,++s){
		rt.resize(n);
		T z[]={1,mpow(T::root(),T::mod()>>s)};
		for(int i=k;i<2*k;++i)rt[i]=rt[i/2]*z[i&1];
	}
	for(int i=0;i<n;++i)rev[i]=(rev[i/2]|(i&1)<<L)/2;
	for(int i=0;i<n;++i)if(i<rev[i])swap(a[i],a[rev[i]]);
	for(int k=1;k<n;k*=2)
		for(int i=0;i<n;i+=2*k)
			for(int j=0;j<k;++j){
				T z=rt[j+k]*a[i+j+k],&ai=a[i+j];
				a[i+j+k]=ai-z;
				ai+=z;
			}
}


vector<vector<vector<mint>>>getdp(vector<int>w,int n,int k){
	vector<vector<vector<mint>>>dp(n+1,vector<vector<mint>>(n+1,vector<mint>(k+1))); // from first i items, taken j items, with weight l
	dp[0][0][0]=1;
	for(int i=1;i<=n;++i){
		for(int j=0;j<=n;++j){
			for(int l=0;l<=k;++l){
				dp[i][j][l]=dp[i-1][j][l]+(j&&l>=w[i-1]?dp[i-1][j-1][l-w[i-1]]:0);
			}
		}
	}
	return dp;
}

void ProGamerMove(){
	int n,k;cin>>n>>k;
	vector<int>w(n);
	for(int&v:w)cin>>v;
	auto dp1=getdp(w,n,k);
	reverse(w.begin(),w.end());
	auto dp2=getdp(w,n,k);
	reverse(w.begin(),w.end());
	vector<vector<mint>>res(n,vector<mint>(n-1)); // my-th person screams, containing j items
	for(int i=0;i<=n;++i)
		for(int j=0;j<=n;++j)
			for(int l=k-1;l>=0;--l)
				dp2[i][j][l]+=dp2[i][j][l+1];
	int s=n+1+n+1-1,B=32-__builtin_clz(s),fn=1<<B;
	mint inv=1/mint(fn);
	vector<mint>L(fn),R(fn),out(fn); // how many ways to take i items from left with weight myw
	vector<int>rev(fn);
	for(int my=0;my<n;++my){ // 0,n,0,k 
		for(int myw=0;myw<=k;++myw){ // w on the left
			L.assign(fn,0);
			R.assign(fn,0);
			for(int i=0;i<=n;++i)L[i]=dp1[my][i][myw];
			for(int i=0;i<=n;++i)R[i]=dp2[n-my-1][i][max(0,k-myw-w[my]+1)]-(myw?dp2[n-my-1][i][k-myw+1]:0);
			rev.assign(fn,0);
			ntt(L,rev);
			rev.assign(fn,0);
			ntt(R,rev);
			for(int i=0;i<fn;++i)out[-i&(fn-1)]=L[i]*R[i]*inv;
			rev.assign(fn,0);
			ntt(out,rev);
			for(int i=1;i<n;++i)res[my][i-1]+=out[i];
		}
	}
	for(auto&vec:res){
		for(auto r:vec)cout<<r<<" ";
		cout<<"\n";
	}
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	cout<<setprecision(9)<<fixed;
	int tc=1;
	//cin>>tc;
	while(tc--)ProGamerMove();
}