#include <iostream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#define setBit(x,b) ((x)|(1<<(b)))
#define getBit(x,b) ((x)&(1<<(b)))
#define N_MAX 31
#define S_MAX 310000000
#define P_MAX 10000000
using namespace std;

typedef struct
{
	int no;
	int P;
}Goods;

int N, S;
Goods G[N_MAX];
vector<int> ans;
int max_p[N_MAX];

bool compG(const Goods& x, const Goods& y)
{
	return x.P > y.P;
}

bool compAns(const int& x, const int y)
{
	for (int i = 1; i <= N; ++i)
	{
		if (getBit(x, i) == getBit(y, i))
			continue;
		return getBit(x, i) > getBit(y, i);
	}
}

void DP(int t, int n, int op)
{
	if (t == 0 && n >= N)
	{
		ans.push_back(op);
		return;
	}

	if (t < 0 || n >= N || max_p[n] < t)
		return;

	DP(t - G[n].P, n + 1, setBit(op, G[n].no));
	DP(t, n + 1, op);
}

void calc()
{
	sort(G, G + N, compG);

	max_p[N - 1] = G[N - 1].P;
	for (int i = N - 2; i >= 0; --i)
	{
		max_p[i] = max_p[i + 1] + G[i].P;
	}

	DP(S, 0, 0);

	sort(ans.begin(), ans.end(), compAns);
}

int main()
{
	cin >> N >> S;

	for (int i = 0; i < N; ++i)
	{
		G[i].no = i + 1;
		cin >> G[i].P;
	}

	calc();

	for (auto it = ans.begin(); it != ans.end(); ++it)
	{
		bool first = true;

		for (int i = 1; i <= N; ++i)
		{
			if (getBit(*it, i))
			{
				if (!first)
					cout << ' ';
				cout << i;
				first = false;
			}
		}
		cout << endl;
	}

	return 0;
}