#include <cstdio>

#define FOR(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define REV(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define INC0(i, n) FOR(i, 0, n)
#define INC1(i, n) FOR(i, 1, (n) + 1)
#define DEC0(i, n) REV(i, 0, n)
#define DEC1(i, n) REV(i, 1, (n) + 1)

typedef long long   signed int LL;
typedef long long unsigned int LU;

struct KV { int k, v; };

void swap(int& x, int& y) {
	int temp = x;
	x = y;
	y = temp;
	
	return;
}

void m_sort_(KV a[], KV b[], int l, int r) {
	if(r - l < 2) { return; }
	
	int m = (l + r) / 2;
	m_sort_(a, b, l, m);
	m_sort_(a, b, m, r);
	
	int ll = l, rr = m, bb = 0;
	while(bb < r - l) {
		bool flag;
		if(rr == r || ll == m) { flag = (rr == r); }
		else { flag = (a[ll].k <= a[rr].k); }
		
		if(flag) { b[bb++] = a[ll++]; }
		else     { b[bb++] = a[rr++]; }
	}
	
	FOR(i, l, r) { a[i] = b[i - l]; }
	
	return;
}
void m_sort(KV a[], int l, int r) {
	KV* b = new KV[r - l];
	m_sort_(a, b, l, r);
	delete[] b;
	
	return;
}


int n, s, p[31];
KV kv1[1 << 15];
KV kv2[1 << 16];
int ans[49], cnt;

int main() {
	scanf("%d%d", &n, &s);
	INC0(i, n) { scanf("%d", &p[i]); }
	
	int m = n / 2;
	
	INC0(i, 1 << m) {
		int sum = 0;
		FOR(j, 0, m) {
			if(i & (1 << j)) { sum += p[j]; }
		}
		kv1[i].k = sum;
		kv1[i].v = i;
	}
	
	INC0(i, 1 << (n - m)) {
		int sum = 0;
		FOR(j, 0, n - m) {
			if(i & (1 << j)) { sum += p[m + j]; }
		}
		kv2[i].k = sum;
		kv2[i].v = i;
	}
	
	m_sort(kv1, 0, 1 << m);
	m_sort(kv2, 0, 1 << (n - m));
	
	int a = 0, b = (1 << (n - m)) - 1;
	while(a < (1 << m) && b >= 0) {
		int ka = kv1[a].k;
		int kb = kv2[b].k;
		int sum = ka + kb;
		if(sum == s) {
			int aa = a, bb = b;
			while(aa <  (1 << m) && kv1[aa].k == ka) { aa++; }
			while(bb >=       0  && kv2[bb].k == kb) { bb--; }
			FOR(aaa, a, aa) {
			FOR(bbb, bb + 1, b + 1) {
				ans[cnt++] = kv1[aaa].v + (kv2[bbb].v << m);
			}
			}
			a = aa;
			b = bb;
		}
		if(sum < s) { a++; }
		if(sum > s) { b--; }
	}

	// 選択ソート
	DEC0(i, cnt) { int p = i;
	INC0(j,   i) {
		INC0(k, n) {
			if( (ans[j] ^ ans[p]) & (1 << k) ) {
				if(ans[p] & (1 << k)) { p = j; }
				break;
			}
		}
	} swap(ans[i], ans[p]);
	}
	
	INC0(i, cnt) {
		bool flag = false;
		INC0(j, n) {
			if(ans[i] & (1 << j)) {
				printf("%s%d", flag ? " " : "", j + 1);
				flag = true;
			}
		}
		printf("\n");
	}
	
	return 0;
}