#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N, S;
	while(cin >> N >> S) {
		vi P(N);
		rep(i, N) cin >> P[i];
		int n1 = N / 2, n2 = N - n1;
		vector<pii> v(1 << n1);
		rep(i, 1 << n1) {
			int sum = 0;
			rep(j, n1) if(i >> j & 1)
				sum += P[j];
			v[i] = mp(sum, i);
		}
		sort(all(v));
		vi w;
		vector<vi> ans;
		rep(i, 1 << n2) {
			int sum = 0;
			rep(j, n2) if(i >> j & 1)
				sum += P[n1 + j];
			int rem = S - sum;
			int l = lower_bound(all(v), mp(rem, -INF)) - v.begin();
			int r = upper_bound(all(v), mp(rem, INF)) - v.begin();
			reu(k, l, r) {
				int subs = v[k].second | (i << n1);
				w.clear();
				rep(j, N) if(subs >> j & 1)
					w.push_back(j + 1);
				ans.push_back(w);
			}
		}
		sort(all(ans));
		each(i, ans) {
			rep(j, i->size()) {
				if(j != 0) putchar(' ');
				printf("%d", (*i)[j]);
			}
			puts("");
		}
	}
	return 0;
}