#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    ll n, s;
    cin >> n >> s;
    vl a(n);
    rep(i, n) cin >> a[i];
    using B = bitset<40>;
    map<ll, vl> mp;
    set<vl> ans;
    int h = (n + 1) / 2;
    rep(mask, 1 << h) {
        ll sum = 0;
        rep(i, h) if (mask & (1 << i)) {
            sum += a[i];
        }
        mp[sum].emplace_back(mask);
    }
    rep(mask, 1 << (n - h)) {
        ll sum = 0;
        vl v;
        rep(i, n - h) if (mask & (1 << i)) {
            sum += a[i + h];
            v.emplace_back(i + h);
        }
        if (sum > s) continue;
        ll d = s - sum;

        for (auto&& x : mp[d]) {
            auto u = v;
            rep(k, h) if (x & (1 << k)) u.emplace_back(k);
            sort(all(u));
            ans.emplace(u);
        }
    }
    for (auto&& v : ans) {
        rep(i, v.size()) cout << v[i] + 1 << (i + 1 == (int)v.size() ? '\n' : ' ');
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}