#define protected public
#include <bits/stdc++.h>
using namespace std; using namespace chrono;
using iii  = int; using yeee = iii;
#ifndef LOCAL
    const iii DEBUG = -1;
#else
    const iii DEBUG = 10;
#endif

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds; template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T1, typename T2> using hash_map = gp_hash_table<T1, T2>;
#define DOUT(...) DOUTg(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#define JOE
template <typename T1> void DOUTf(ostringstream &os, int names_i, vector<string> &names, T1 &&val) { if(names[names_i].rfind("JOE ", 0) == string::npos) os << names[names_i] << " = "; os << val; } template <typename T1, typename... Ts> void DOUTf(ostringstream &os, int names_i, vector<string> &names, T1 &&val, Ts &&... vals) { DOUTf(os, names_i, names, val); os << " | "; DOUTf(os, names_i + 1, names, vals...); } template <typename... Ts> string DOUTg(int line_no, string names, Ts &&... vals) { string special = "()[]{}<>'\"\\"; vector<string> vnames; vnames.push_back(""); vector<char> stak; for(char c : names) { bool inside_string = !stak.empty() && (stak.back() == '\'' || stak.back() == '\"'); if(c == '\n') c = ' '; if(c == ' ' && (vnames.back().empty() || (!inside_string && vnames.back().back() == ' '))) continue; if(stak.empty() && c == ',') { if(!vnames.back().empty() && vnames.back().back() == ' ') vnames.back().pop_back(); vnames.push_back(""); continue; } vnames.back().push_back(c); if(!stak.empty() && stak.back() == '\\') { stak.pop_back(); continue; } size_t p = special.find(c); bool closing = p < 8 && p % 2; if(p == string::npos) continue; if(p == special.size() - 1) { stak.push_back(c); continue; } if(stak.empty()) { if(!closing) stak.push_back(c); continue; } if(inside_string) { if(c == stak.back()) stak.pop_back(); continue; } if(closing) { if(stak.back() == special[p - 1]) stak.pop_back(); continue; } stak.push_back(c); } ostringstream os; os << "/" << line_no << "/: "; DOUTf(os, 0, vnames, vals...); return os.str(); }
template <template <typename...> class Container, typename T, size_t DIMENSION> struct MultiDimensional { using internal = MultiDimensional<Container, T, DIMENSION - 1>; using type = Container<typename internal::type>; template <typename... Args> static type Generate(T def, const size_t size, Args... sizes) { return type(size, internal::Generate(def, sizes...)); } }; template <template <typename...> class Container, typename T> struct MultiDimensional<Container, T, 1> { using internal = T; using type = Container<T>; static type Generate(T def, const size_t size) { return type(size, def); } }; template <typename T, typename... Args> auto make_vector(T def, Args... sizes) -> typename MultiDimensional<std::vector, T, sizeof...(sizes)>::type { return MultiDimensional<std::vector, T, sizeof...(sizes)>::Generate( def, sizes...); }

#define DBG(x) if(DEBUG >= x)
#define MANY_TESTS ll TCn; cin >> TCn; for(ll TCi=0; TCi<TCn; ++TCi)
#define FOR(i, lo, hi) for(ll i = ll(lo); i < ll(hi); ++i)
#define ROF(i, hi, lo) for(ll i = ll(hi); i >= (ll)(lo); --i)
#define ALL(x) (x).begin(), (x).end()
#define len(x) ll((x).size())
#define fst first
#define snd second

/*get*/ template <typename T> T get() { T x; cin >> x; return x; } /*pair*/ template <typename T1, typename T2> ostream &operator<<(ostream &out, const pair<T1, T2> &cont) { out << "(" << cont.first << ", " << cont.second << ")"; return out; } /*vector*/ template <typename T, typename Alloc> ostream &operator<<(ostream &out, const vector<T, Alloc> &cont) { for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : " ") << *it; return out; } /*deque*/ template <typename T, typename Alloc> ostream &operator<<(ostream &out, const deque<T, Alloc> &cont) { for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : " ") << *it; return out; } /*set*/ template <typename T, typename Compare, typename Alloc> ostream &operator<<(ostream &out, const set<T, Compare, Alloc> &cont) { out << "{"; for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : ", ") << *it; out << "}"; return out; } /*multiset*/ template <typename T, typename Compare, typename Alloc> ostream &operator<<(ostream &out, const multiset<T, Compare, Alloc> &cont) { out << "{"; for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : ", ") << *it; out << "}"; return out; } /*map*/ template <typename Key, typename T, typename Compare, typename Alloc> ostream &operator<<(ostream &out, const map<Key, T, Compare, Alloc> &cont) { out << "{"; for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : ", ") << it->first << ":" << it->second; out << "}"; return out; } /*multimap*/ template <typename Key, typename T, typename Compare, typename Alloc> ostream &operator<<(ostream &out, const multimap<Key, T, Compare, Alloc> &cont) { out << "{"; for(auto it = cont.begin(); it != cont.end(); ++it) out << (it == cont.begin() ? "" : ", ") << it->first << ":" << it->second; out << "}"; return out; } /*vectorND*/ template <typename T> ostream &operator<<(ostream &out, vector<vector<T>> cont) { for(auto it = cont.begin(); it != cont.end(); ++it) out << *it << "\n"; return out; }
using ll = long long; using lll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using vb = vector<bool>; using vvb = vector<vb>; using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>; using vpll = vector<pll>; template<size_t N> using arll = array<ll, N>; using point = complex<ll>;
ld get_time() { return ld(duration_cast<nanoseconds>(high_resolution_clock::now().time_since_epoch()).count()) / 1e9; } ll sign(ld x) { return (x > 0) - (x < 0); } ll fmod(ll x, ll mod) { if(!mod) return x; if(abs(x) >= mod) x %= mod; if(x < 0) x += mod; return x; } ll pow(ll x, ll exp, ll mod) { ll res = 1, y = x; while(exp) { if(!mod) { if(exp & 1) res = res * y; y = y * y; } else { if(exp & 1) res = fmod(res * y, mod); y = fmod(y * y, mod); } exp >>= 1; } return res; }
ld START_TIME = get_time(); mt19937_64 rand_mt64(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rand_mt(chrono::steady_clock::now().time_since_epoch().count()); const long long INFll = ll(1.1e18) - 1; const int INFi = ll(1.1e9) - 1; ll INF = sizeof(ll) == sizeof(int) ? ll(INFi) : ll(INFll); const ll MOD = 1e9+7; char newl = '\n';
void main_init(bool fast_cio = true, string input_file = "", string output_file = "", pair<int, int> file_mask={1,1}) { srand(unsigned(time(0))); if(fast_cio) { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } if(input_file != "" && file_mask.first & (1 << (DEBUG < 0))) freopen(input_file.c_str(), "r", stdin); if(output_file != "" && file_mask.second & (1 << (DEBUG < 0))) freopen(output_file.c_str(), "w", stdout); }

#define M 401

yeee main() {
    main_init();
    //

                                    // TODO M
    const ll MOD = 167772161;

    ll N, K;
    cin >> N >> K;

    vll W(N);
    FOR(i, 0, N)
        cin >> W[i];
    
    ll D[M][M];
    FOR(exclude, 0, N) {
        FOR(y, 0, M)
            FOR(x, 0, M)
                D[y][x] = 0;
        D[0][0] = 1;
        ll max_n = 0;
        FOR(i, 0, N) {
            if(i == exclude)
                continue;
            ll max_w = K - W[i] + 1;
            ROF(n, max_n, 0)
                FOR(w, 0, max_w) {
                    ll d = D[n + 1][w + W[i]] + D[n][w];
                    D[n + 1][w + W[i]] = d >= MOD ? d - MOD : d;
                }
            max_n++;
        }
        // FOR(y, 0, M) {
        //     FOR(x, 0, M)
        //         cerr << D[y][x] << " ";
        //     cerr << endl;
        // }

        vll res(N, 0);
        FOR(n, 0, N) {
            FOR(w, K + 1 - W[exclude], K + 1) {
                res[n] = (res[n] + D[n][w]) % MOD;
            }
        }
        cout << vll(res.begin()+1, res.end()) << newl;
    }
}

                                        // TODO M