#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##z=(b);i<=i##z;i++)
#define ROF(i,a,b) for(int i=(a),i##z=(b);i>=i##z;i--)
using namespace std; 
const int N=int(4e2)+10,mo=167772161;

int read() {
    int x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9') {
        if(c == '-') f = -1;
        c = getchar();
    }
    while('0' <= c && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * f;
}

int a[N],n,K,ans[N][N];
int pre[N][N][N],suf[N][N][N],psuf[N][N][N];

template<typename T>T mul(T x,T y){ return 1ll*x*y%mo; }

int mpw(int x,int y){ int r=1; for(;y;x=mul(x,x),y>>=1) if(y&1) r=mul(r,x); return r; }
int inv(int x){ return mpw(x,mo-2); }

int trs[N*3],L;
void prework(int len){
	L=1; while(L<=len) L<<=1;
	FOR(i,0,L-1) trs[i]=(trs[i>>1]>>1)|((i&1)?L>>1:0);
}
void ntt(int *a,bool op){
	int G=3,invG=inv(G);
	FOR(i,0,L-1) if(i<trs[i]) swap(a[i],a[trs[i]]);
	for(int len=2;len<=L;len<<=1){
		int bs=op?mpw(invG,(mo-1)/len):mpw(G,(mo-1)/len);
		for(int i=0;i<L;i+=len){
			int now=1;
			for(int k=i;k<i+(len>>1);k++){
				int tmp=mul( now , a[k+(len>>1)] );
				a[k+(len>>1)]=(a[k]-tmp+mo)%mo;
				a[k]=(a[k]+tmp)%mo;
				now=mul( now , bs );
			}
		}
	}
}

void mul(int *a,int *b,int *c){
	ntt(a,0),ntt(b,0);
	FOR(i,0,L-1) c[i]=mul(a[i],b[i]);
	ntt(c,1); int ppp=inv(L);
	FOR(i,0,L-1) c[i]=mul(c[i],ppp);
}

void Add(int &x,int y){ (x+=y,x>=mo?x-=mo:x); }
int check(int x){ return x>=mo?x-mo:x; }

int check_len(int *a,int ed){
	while(a[ed]==0 && ed>0) ed--;
	return ed+1;
}

int main(){
	
//	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
	
	int t1=clock();
	
	cin>>n>>K; FOR(i,1,n) cin>>a[i];
	
	pre[0][0][0]=1;
	FOR(i,1,n) FOR(j,0,i) FOR(k,0,K){
		Add(pre[i][j][k],pre[i-1][j][k]);
		if(k<a[i]) continue;
		Add(pre[i][j][k],pre[i-1][j-1][k-a[i]]);
	}
	
	suf[n+1][0][0]=1;
	ROF(i,n,1) FOR(j,0,n-i+1) FOR(k,0,K){
		Add(suf[i][j][k],suf[i+1][j][k]);
		if(k<a[i]) continue;
		Add(suf[i][j][k],suf[i+1][j-1][k-a[i]]);
	}
	ROF(i,n+1,0) FOR(j,0,n-i+1){
		psuf[i][j][0]=suf[i][j][0];
		FOR(k,1,K) psuf[i][j][k]=check(psuf[i][j][k-1]+suf[i][j][k]);
	}
	
	static int p[N*3],q[N*3],r[N*3];
	
	int t2=clock();
	cerr<<"?"<<t2-t1<<endl;
	
	FOR(i,1,n) FOR(k,0,K){
		//FOR(j,0,L-1) p[j]=q[j]=0;
		FOR(j,0,n-1){
			p[j]=pre[i-1][j][k];
			q[j]=( psuf[i+1][j][K-k] - (K-k-a[i]<0?0:psuf[i+1][j][K-k-a[i]]) + mo )%mo;
		//	FOR(dk,0,a[i]-1) if(K-k-dk>=0)
		//		Add(q[j],suf[i+1][j][K-k-dk]);
		}
		int len1=check_len(p,n-1);
		int len2=check_len(q,n-1);
		prework(len1+len2);
		FOR(j,n,L-1) p[j]=q[j]=0;
		mul(p,q,r);
		FOR(j,0,min(n-1,L-1)) Add(ans[i][j],r[j]);
	}
	
	FOR(i,1,n) FOR(j,1,n-1) cout<<ans[i][j]<<" \n"[j==n-1];
	
	return 0;
}