// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>

using namespace std;

#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)

#define mp( a, b ) make_pair( a, b )
#define pb( a ) push_back( a )
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector

// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(a) + OFFSET_X << ","										\
	<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(r) << ")" << endl;

typedef long long ll;
typedef complex<double> Point;

typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;

typedef vector<int>::iterator vi_itr;

const int IINF = 1 << 28;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);

// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };

struct Data
{
	ll id, cost;

	Data() {}
	Data( ll id, ll cost ) :id(id), cost(cost) {}

	bool operator < ( const Data& d ) const
	{
		return cost < d.cost;
	}
};

ll N, S;
ll P[32];
Data d[2][1 << 16];
int main()
{
	cin >> N >> S;
	rep(i, N) cin >> P[i];

	int n1 = N/2, n2 = N - n1;
	rep(i, 1 << n1){
		ll sum = 0;
		rep(j, n1){
			sum += (i & (1 << j)) ? P[j] : 0;
		}
		d[0][i] = Data(i, sum);
	}
	rep(i, 1 << n2){
		ll sum = 0;
		rep(j, n2){
			sum += (i & (1 << j)) ? P[n1+j] : 0;
		}
		d[1][i] = Data(i, sum);
	}

	stable_sort( d[0], d[0]+(1 << n1) );
	stable_sort( d[1], d[1]+(1 << n2) );

	set<vi> ans;
	rep(i, 1 << n2){
		auto itr1 = lower_bound( d[0], d[0]+(1 << n1), Data(0, S - d[1][i].cost) );
		auto itr2 = upper_bound( d[0], d[0]+(1 << n1), Data(0, S - d[1][i].cost) );
		
		if( itr2 - itr1 > 0 ){
			for( auto itr = itr1; itr != itr2; ++itr ){
				vi tmp;
				string str = "";
				bool isFirst = true;
				rep(j, n1){
					if( (itr->id & (1 << j)) != 0 ){
						tmp.pb(j+1ll);
					}
				}
				rep(j, n2){
					if( (d[1][i].id & (1 << j)) != 0 ){
						tmp.pb(n1+j+1ll);
					}
				}
				ans.insert(tmp);
			}
		}
	}

	for( auto s : ans ){
		rep(i, s.size()){
			if( i != 0 ) cout << " ";
			cout << s[i];
		}
		cout << endl;
	}
}