#include "bits/stdc++.h"
using namespace std;

typedef long long Int;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);++(i))

Int a[31];
int main() {
	int N;
	Int S;
	cin >> N >> S;
	REP(i, N) cin >> a[i];
	
	int half1 = N / 2;
	int half2 = N - half1;
	vector<pair<Int, int>> v;
	REP(i, 1 << half1) {
		Int s = 0;
		REP(j, half1) {
			if (i >> j & 1) s += a[j];
		}
		v.push_back(make_pair(s, i));
	}
	sort(v.begin(), v.end());

	vector<int> ans;
	REP(iii, 1 << half2) {
		int i = iii << half1;
		Int s = 0;
		REP(j, N) {
			if (i >> j & 1) s += a[j];
		}
	
		int pos = lower_bound(v.begin(), v.end(), make_pair(S - s, -1)) - v.begin();
		while (pos < v.size() && v[pos].first == S - s) {
			ans.push_back(v[pos].second | i);
			pos++;
		}
	}
	
	vector<vector<int>> sa;

	for (auto x : ans) {
		vector<int> y;
		REP(i, N) if (x >> i & 1) {
			y.push_back(i + 1);
		}
		sa.emplace_back(y);
	}
	sort(sa.begin(), sa.end());
	for (auto x : sa) {
		bool first = true;
		for (auto i : x) {
			if (first) first = false; else cout << " ";
			cout << i;
		}
		cout << endl;
	}

}