#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,S;
int P[33];
map<int, vector<int>> M;

void solve() {
    cin>>N>>S;
    REP(i,N)cin>>P[i];
    int N1 = N/2;
    int N2 = N-N1;
    REP(i,1LL<<N2) {
        bitset<32> b(i);
        int s = 0;
        REP(j,N2) if (b[j]) s += P[N1+j];
        M[s].push_back(i);
    }
    vector<int> ans;
    REP(i,1LL<<N1) {
        bitset<32> b(i);
        int s = 0;
        REP(j,N1) if (b[j]) s+=P[j];
        for (auto k:M[S-s]) {
            ans.push_back((k<<N1) + i);
        }
    }
    sort(ALL(ans), [](int a, int b){
        bitset<32> ba(a), bb(b);
        REP(i,N) {
            if (ba[i] > bb[i]) return 1;
            if (ba[i] < bb[i]) return 0;
        }
        return 0;
    });
    for (int i:ans) {
        bitset<32> b(i);
        REP(j,N) if (b[j]) cout << j+1 << " ";
        cout << endl;
    }
}