#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
 
int N;
int S;
int P[50];
 
void gen(int s, int N, vector< pair<int,int> >& stock){
	for(int m=0;m<1<<N;m++){
		int sum = 0;
		for(int i=0;i<N;i++){
			if((m >> i) & 1){
				sum += P[s + i];
			}
		}
		stock.push_back(make_pair(sum, m));
	}
}
 
void solve(){
	vector< pair<int, int> > Left;
	vector< pair<int, int> > Right;
 
	int L = N / 2, R = N - L;
	gen(0, L, Left);
	gen(L, R, Right);
 
	sort(Right.begin(), Right.end());
 
	vector<int> RightVal(Right.size());
	for(int i=0;i<Right.size();i++){
		RightVal[i] = Right[i].first;
	}
 
	for(int i=0;i<Left.size();i++){
		int lval = Left[i].first;
		int lmem = Left[i].second;
 
		auto ps = equal_range(RightVal.begin(), RightVal.end(), S - lval);
 
		int s = ps.first  - RightVal.begin();
		int t = ps.second - RightVal.begin();
 
		for(int j=s;j<t;j++){
			int rmem = Right[j].second;
 
			for(int k=0;k<L;k++){
				if((lmem >> k) & 1){
					cout << (k + 1) << " ";
				}
			}
 
			for(int k=0;k<R;k++){
				if((rmem >> k) & 1){
					cout << (L + k + 1) << " ";
				}
			}
 
			cout << endl;
		} 
	}
}
 
int main(){
	cin >> N >> S;
	for(int i=0;i<N;i++)cin >> P[i];
 
	solve();
	return 0;
}