# -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections as coll

N, S = map(int, raw_input().split())
P = [int(raw_input()) for i in xrange(N)]

dic = {0:()}
for i in xrange(1, N / 2 + 1):
    for select in it.combinations(range(N / 2), i):
        s = sum(P[j] for j in select)
        if s in dic:
            dic[s] = min(dic[s], select)
        else:
            dic[s] = select

ans = [32] 
for i in xrange(1, N - N / 2 + 1):
    for select in it.combinations(range(N / 2, N), i):
        s = sum(P[j] for j in select)
        if S - s in dic:
            ans = min(ans, list(dic[S - s] + select))
ans = [i + 1 for i in ans]
print " ".join(map(str, ans))