#include <bits/stdc++.h>

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

void decode(ll c, ll d)
{
    stack<ll> st;
    for (ll i = 0; i < d; i++) {
        if ((c >> i) % 2) {
            st.push(d - i);
        }
    }
    bool first = true;
    while (not st.empty()) {
        if (not first) {
            cout << " ";
        }
        first = false;
        cout << st.top();
        st.pop();
    }
    cout << endl;
}

int main()
{
    ll n;
    ll s;
    cin >> n >> s;
    vector<ll> p(n);
    rep(i, n)
    {
        cin >> p[n - 1 - i];
    }
    const ll former = n / 2;
    const ll latter = n - former;
    const ll formernum = (1LL << former);
    const ll latternum = (1LL << latter);

    vector<ll> formersum(formernum);
    formersum[0] = 0;
    for (ll c = 1; c < formernum; c++) {
        for (ll b = 0; b < former; b++) {
            if ((c >> b) % 2) {
                formersum[c] = formersum[c - (1LL << b)] + p[b];
                break;
            }
        }
    }

    vector<pair<ll, ll>> lattersum(latternum);
    lattersum[0] = mp(0LL, 0LL);
    for (ll c = 1; c < latternum; c++) {
        for (ll b = 0; b < latter; b++) {
            if ((c >> b) % 2) {
                lattersum[c] = mp(lattersum[c - (1LL << b)].first + p[b + former], c << former);
                break;
            }
        }
    }

    sort(lattersum.begin(), lattersum.end());

    vector<ll> choice;
    for (ll fc = 0; fc < formernum; fc++) {
        const ll rest = s - formersum[fc];
        auto ite = lower_bound(lattersum.begin(), lattersum.end(), mp(rest, -1LL));
        while (ite->first == rest) {
            choice.pb(ite->second + fc);
            ite++;
        }
    }

    sort(choice.begin(), choice.end(), greater<ll>());
    for (const ll c : choice) {
        decode(c, n);
    }

    return 0;
}