#include <iostream>
#include <map>
#include <string>
#include <vector>

using namespace std;

int N;
long long S;
int P[31];
map<long long, vector<int> > first;
map<long long, vector<int> > second;

int main() {
	cin >> N >> S;
	for (int i = 0; i < N; i++) {
		cin >> P[i];
	}
	if (N <= 16) {
		for (int mask = (1 << N) - 1; mask >= 0; mask--) {
			long long sum = 0;
			for (int i = 0; i < N; i++) {
				if ((mask >> (N - i - 1)) & 1) {
					sum += P[i];
				}
			}
			if (sum == S) {
				string str;
				for (int i = 0; i < N; i++) {
					if ((mask >> (N - i - 1)) & 1) {
						str += to_string(i + 1) + " ";
					}
				}
				cout << str.substr(0, str.length() - 1) << endl;
			}
		}
	} else {
		for (int mask = (1 << 16) - 1; mask >= 0; mask--) {
			long long sum = 0;
			for (int i = 0; i < 16; i++) {
				if ((mask >> (16 - i - 1)) & 1) {
					sum += P[i];
				}
			}
			first[sum].push_back(mask);
		}
		for (int mask = (1 << (N - 16)) - 1; mask >= 0; mask--) {
			long long sum = 0;
			for (int i = 0; i < N - 16; i++) {
				if ((mask >> (N - 16 - i - 1)) & 1) {
					sum += P[i + 16];
				}
			}
			second[sum].push_back(mask);
		}
		for (const auto& itr : first) {
			if (second.find(S - itr.first) != second.end()) {
				for (const int& mask0 : itr.second) {
					string str0;
					for (int i = 0; i < 16; i++) {
						if ((mask0 >> (16 - i - 1)) & 1) {
							str0 += to_string(i + 1) + " ";
						}
					}
					for (const int& mask1 : second[S - itr.first]) {
						string str1;
						for (int i = 0; i < N - 16; i++) {
							if ((mask1 >> (N - 16 - i - 1)) & 1) {
								str1 += to_string(i + 16 + 1) + " ";
							}
						}
						string str = str0 + str1;
						cout << str.substr(0, str.length() - 1) << endl;
					}
				}
			}
		}
	}
	return 0;
}