#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
//const int MOD = 1000000007;
const int MOD = 998244353;


int main() {
	int n, s;
	cin >> n >> s;
	vi a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	int n1 = n / 2;
	int n2 = n - n1;
	int n1max = 1 << n1;
	int n2max = 1 << n2;
	vl s1(n1max, 0), s2(n2max, 0);
	bitset<16> bs;
	for (int i = 1; i < n1max; i++) {
		bs = i;
		ll sum = 0;
		for (int i = 0; i < n1; i++) {
			if (bs[i]) sum += a[i];
		}
		s1[i] = sum;
	}
	for (int i = 1; i < n2max; i++) {
		bs = i;
		ll sum = 0;
		for (int i = 0; i < n2; i++) {
			if (bs[i]) sum += a[i + n1];
		}
		s2[i] = sum;
	}

	map<int, vi> mp;
	for (int i = 0; i < n2max; i++) {
		mp[s2[i]].push_back(i);
	}
	vvi ans;
	for (int i = 0; i < n1max; i++) {
		auto itr = mp.find(s - s1[i]);
		if (itr == mp.end()) continue;
		vi tmp;
		for (int j = 0; j < n1; j++) {
			if ((i >> j) & 1) tmp.push_back(j + 1);
		}

		for (auto& x : itr->second) {
			ans.push_back(tmp);
			for (int j = 0; j < n2; j++) {
				if ((x >> j) & 1) {
					ans.back().push_back(n1 + j + 1);
				}
			}
		}

	}

	sort(ans.begin(), ans.end());
	for (size_t y = 0; y < ans.size(); y++) {
		for (size_t x = 0; x < ans[y].size(); x++) {
			if (x > 0) cout << " ";
			cout << ans[y][x];
		}
		cout << endl;
	}

	return 0;
}