import bisect


def solve(N, S, P):
    h = len(P) // 2
    F = P[:h]
    L = P[h:]

    def listup(p):
        m = [0] * (1 << len(p))
        for i in range(1 << len(p)):
            s = 0
            for j in range(len(p)):
                if i & (1 << j):
                    s += p[j]
            m[i] = (s, i)
        return m

    fm = listup(F)
    lm = listup(L)

    lm.sort()

    ans = []

    for fi in range(1 << h):
        fp = fm[fi][0]
        lp = S - fp
        lil = bisect.bisect_left(lm, (lp, 0))
        lir = bisect.bisect_right(lm, (lp, S))
        for l in range(lil, lir):
            if l < len(lm) and lm[l][0] == lp:
                ans.append((l << h) | fi)

    ans = [[i + 1 for i in range(N) if a & (1 << i)] for a in ans]

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


def main():
    N, S = list(map(int, input().split()))
    P = [0] * N
    for i in range(N):
        P[i] = int(input())
    solve(N, S, P)


if __name__ == '__main__':
    main()