#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vb  = vector<bool>;
using vvi = vector<vi>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll  INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;

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

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    ll N, S; cin >> N >> S;
    vl P(N); REP(i, N) cin >> P[i];

    vector<pl> a, b;
    ll n = N / 2;
    N -= n;

    REP(i, 1 << n)
    {
        ll sum = 0;
        REP(j, n) if(i & (1 << j)) sum += P[j];
        a.pb(mp(sum, i));
    }

    REP(i, 1 << N)
    {
        ll sum = 0;
        REP(j, N) if(i & (1 << j)) sum += P[n+j];
        b.pb(mp(sum, i));
    }

    sort(ALL(b));

/*
    cout << endl;
    REP(i, (int)a.size()) cout << a[i].first << " " << a[i].second << endl;
    cout << endl;
    REP(i, (int)b.size()) cout << b[i].first << " " << b[i].second << endl;
    cout << endl;
*/

    vvi ans;
    REP(i, (int)a.size())
    {
        //cout << a[i].first << endl;
        for(auto j = lower_bound(ALL(b), mp(S-a[i].first, 0LL)); j->first == S-a[i].first; j++)
        {
            //cout << j->first << endl;
            //string t = "";
            vi t;
            REP(k, n) if(a[i].second & (1 << k)) t.pb(k+1);
            REP(k, N) if(j->second & (1 << k)) t.pb(n+k+1);
            ans.pb(t);
        }
    }

    sort(ALL(ans));
    REP(i, (int)ans.size())
    {
        REP(j, (int)ans[i].size()) cout << ans[i][j] << " ";
        cout << endl;
    }
}