import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = 18446744073709551615
inf = 4294967295
md = 10**9+7
# md = 998244353

from collections import defaultdict

def split_and_list(aa):
    bs = [(0, 0)]
    for i, a in enumerate(aa):
        nbs = []
        for b, s in bs:
            nb = b | 1 << i
            ns = s+a
            nbs.append((nb, ns))
        bs += nbs

    res = defaultdict(list)
    for b, s in bs: res[s].append(b)
    return res

n, S = LI()
n2 = n//2

pp = [II() for _ in range(n)]
pre = split_and_list(pp[:n2])
pos = split_and_list(pp[n2:])

bs = []
for s, bb in pre.items():
    for b0 in bb:
        for b1 in pos[S-s]:
            bs.append(b0 | b1 << n2)

ans = []
for b in bs:
    cur = [i+1 for i in range(n) if b >> i & 1]
    ans.append(cur)

ans.sort()
for cur in ans: print(*cur)