def f(r):
    n = len(r)
    v = [0]*(1<<n)
    for i in range(n):
        for j in range(1<<i):
            v[j+(1<<i)] = v[j] + r[i]
    return v

n,s,*p = map(int,open(0).read().split())

a = f(p[:n//2])
b = f(p[n//2:])

from collections import defaultdict
d = defaultdict(list)
for i,ai in enumerate(a):
    d[ai].append(i)

ans = []
for j,bj in enumerate(b):
    if s-bj in d:
        for i in d[s-bj]:
            v = (j<<n//2)+i
            r = []
            for i in range(n):
                if v>>i&1: r.append(i+1)
            ans.append(r)
ans.sort()
for r in ans:
    print(*r)