from itertools import combinations

def main():
    n, s = map(int, input().split())
    pi = []
    for _ in range(n):
      pi.append(int(input()))

    if n == 1:
        if pi[0] == s:
            print(1)
        else:
            print(-1)
        return

    m1 = n // 2
    m2 = n - m1

    hi = {}
    for i in range(1 << m2):
        u = sum(pi[j + m1] for j in range(m2) if (i >> j) & 1)
        if u not in hi:
            hi[u] = []
        hi[u].append(i)

    ri = []
    for i in range(1 << m1):
        u = sum(pi[j] for j in range(m1) if (i >> j) & 1)
        w = s - u
        if w < 0 or w not in hi:
            continue
        ri.extend([(x << m1) | i for x in hi[w]])

    if not ri:
        print(-1)
    else:
        ri2 = [sorted([j + 1 for j in range(n) if (r >> j) & 1]) for r in ri]
        ri2.sort()
        for r in ri2:
            print(" ".join(map(str, r)))

main()