n, s = map(int, input().split())
P = [int(input()) for i in range(n)]

a = n//2
b = n-a

A = P[0:a]
B = P[a:n]

da = {}
for i in range(2**a):
    p = 0
    for j in range(a):
        if (i >> j) & 1:
            p += A[j]
    if p not in da:
        da[p] = [i]
    else:
        da[p].append(i)

db = {}
for i in range(2**b):
    p = 0
    for j in range(b):
        if (i >> j) & 1:
            p += B[j]
    if p not in db:
        db[p] = [i]
    else:
        db[p].append(i)

ans = []
for k1, v1l in da.items():
    k2 = s-k1
    if k2 in db:
        for v1 in v1l:
            for v2 in db[k2]:
                ans.append(v1+v2*(2**a))
#print(ans)
L = [[] for _ in range(len(ans))]
for i in range(len(ans)):
    t = ans[i]
    for j in range(n):
        if (t >> j) & 1:
            L[i].append(j+1)
L.sort()
#print(L)
for l in L:
    print(*l)