#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

vector<int> merge(vector<int> &a, vector<int> &b){
	vector<int> res;
	for (auto e : a) res.push_back(e);
	for (auto e : b) res.push_back(e);
	sort(ALL(res));
	return res;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, S;
	cin >> n >> S;
	vector<int> a(n);
	rep(i, n) cin >> a[i];

	int k = n / 2;

	vector<pair<int, vector<int>>> v;
	set<vector<int>> ans;
	rep(i, 1 << k){
		vector<int> use;
		int sum = 0;
		rep(j, k) if (i >> j & 1) use.push_back(j), sum += a[j];

		v.emplace_back(MP(sum, use));
		if (sum == S) ans.insert(use);
	}

	sort(ALL(v));

	rep(i, 1 << (n - k)){
		vector<int> use;
		int sum = 0;
		rep(j, n - k) if (i >> j & 1) use.push_back(k + j), sum += a[k + j];

		auto it = lower_bound(ALL(v), MP(S-sum, vector<int>()));

		if (sum == S) ans.insert(use);
		while (it != v.end() && it->first == S - sum){
			ans.insert(merge(use, it->second));
			++it;
		}
	}

	for (auto vec : ans){
		int m = vec.size();
		rep(i, m) cout << vec[i]+1 << (i == m - 1 ? '\n' : ' ');
	}

	return 0;
}