#include<bits/stdc++.h>
using namespace std;

const long long mod = 167'772'161ll;
const int MAXN = 405;
long long n,k,ans[MAXN][MAXN],w[MAXN];

void calc(int l,int r,vector<vector<long long>> dp){
    /*
    cout<<l<<" "<<r<<"\n";
    cout<<"dp\n";
    for(auto i : dp){
        for(auto j : i){
            cout<<j<<" ";
        }
        cout<<"\n";
    }
    */
    if(l==r){
        for(int i=1;i<=n-1;i++){
            long long val = 0;
            for(int j=k-w[l]+1;j<=k;j++){
                val+=dp[i][j];
                val%=mod;
            }
            ans[l][i]=val;
        }
        return;
    }
    
    int mid = (l+r)/2;
    auto left = dp, right = dp;
    
    for(int i=l;i<=mid;i++){
        auto succ = left;
        for(int num=1;num<n;num++){
            for(int sum=w[i];sum<=k;sum++){
                succ[num][sum] += left[num-1][sum-w[i]];
                succ[num][sum] %= mod;
            }
        }
        left = succ;
    }
    
    for(int i=mid+1;i<=r;i++){
        auto succ = right;
        for(int num=1;num<n;num++){
            for(int sum=w[i];sum<=k;sum++){
                succ[num][sum] += right[num-1][sum-w[i]];
                succ[num][sum] %= mod;
            }
        }
        right = succ;
    }
    
    calc(l,mid,right);
    calc(mid+1,r,left);
}

void solve(int t){
    cin>>n>>k;
    
    for(int i=0;i<n;i++){
        cin>>w[i];
    }
    
    auto dp = vector<vector<long long>>(n,vector<long long>(k+1));
    dp[0][0]=1;
    
    calc(0,n-1,dp);

    for(int i=0;i<n;i++){
        for(int j=1;j<=n-1;j++){
            ans[i][j]+=mod;
            ans[i][j]%=mod;
            cout<<ans[i][j]<<" ";
        }
        cout<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}