import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N,S=map(int,readline().split())
N0,N1=N//2,N-N//2
P0=[int(readline()) for _ in range(N0)]
P1=[int(readline()) for _ in range(N1)]
dct=defaultdict(list)
for bit in range(1<<N1):
    x=0
    for i in range(N1):
        if bit>>i&1:
            x+=P1[i]
    dct[x].append(bit)
ans_lst=[]
for bit in range(1<<N0):
    x=0
    for i in range(N0):
        if bit>>i&1:
            x+=P0[i]
    if S-x in dct:
        for bit_ in dct[S-x]:
            ans_lst.append(bit+(bit_<<N0))
ans_lst=[[i+1 for i in range(N) if bit>>i&1] for bit in ans_lst]
ans_lst.sort()
for ans in ans_lst:
    print(*ans)