#include <bits/stdc++.h> 

#define int long long
#define double long double

#define REP(i, b) for(int i = 0; i < (b); i++)
#define REPS(i, b) for(int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()

#define fi first
#define se second
#define pb push_back
#define mp make_pair

using namespace std;

using pi = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vvb = vector<vb>;

const int INF = 1e16;
const int MOD = 1e9+7;

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


signed main()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N, S; cin >> N >> S;
    vi P(N); REP(i, N) cin >> P[i];
    vpi X, Y;
    REP(i, 1 << N/2)
    {
        int sum = 0;
        REP(j, N/2)
        {
            if(i & (1 << j)) sum += P[j];
        }
        X.push_back(mp(sum, i));
    }
    REP(i, 1 << (N+1)/2)
    {
        int sum = 0;
        REP(j, (N+1)/2)
        {
            if(i & (1 << j)) sum += P[j+N/2];
        }
        Y.push_back(mp(sum, i));
    }
    sort(ALL(Y));

    #ifdef DEBUG
        REP(i, X.size())
        {
            cout << X[i].fi << " : " << bitset<64>(X[i].se) << endl;
        }
        REP(i, Y.size())
        {
            cout << Y[i].fi << " : " << bitset<64>(Y[i].se) << endl;
        }
    #endif

    vi ans;
    REP(i, X.size())
    {
        int t = S - X[i].fi;
        for(auto itr = lower_bound(ALL(Y), mp(t, (int)0)); itr != upper_bound(ALL(Y), mp(t, INF)); itr++)
        {
            ans.push_back((itr->se << (N/2)) + X[i].se);
            //cout << bitset<64>((itr->se << (N/2)) + X[i].se) << endl;
        }
    }

    #ifdef DEBUG
        cout << ans.size() << endl;
    #endif

    vvi output(ans.size());

    REP(i, ans.size())
    {
        REP(j, N)
        {
            if(ans[i] & (1 << j)) output[i].push_back(j+1);
        }
    }

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