#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <list>
#include <stdio.h>
using namespace std;

#define REP(i,n) for(long long (i)=0;(i)<(long long)(n);(i)++)
#define RREP(i,n) for(long long (i)=(long long)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

typedef long long ll;

map< ll, set<ll> > M1;
map< ll, set<ll> > M2;


int main(){
    
    ll N,S; cin>>N>>S;
    vector<ll> P1,P2;
    
    REP(i,N){
        ll t; cin>>t;
        if(i<N/2)P1.push_back(t);
        else P2.push_back(t);
    }
    
    for(int i=0;i<(1<<P1.size());i++){
        set<ll> t;
        ll sum=0;
        REP(j,P1.size()){
            if((i>>j)&1){
                sum+=P1[j];
                t.insert(j+1);
            }
        }
        M1[sum]=t;
    }
    
    for(int i=0;i<(1<<P2.size());i++){
        set<ll> t;
        ll sum=0;
        REP(j,P2.size()){
            if((i>>j)&1){
                sum+=P2[j];
                t.insert(j+N/2+1);
            }
        }
        M2[sum]=t;
    }
    
    vector< set<ll> > ans;
    for(auto itr1=M1.begin();itr1!=M1.end();itr1++){
        for(auto itr2=M2.begin();itr2!=M2.end();itr2++){
            ll sum=itr1->first+itr2->first;
            if(sum==S){
                set<ll> t=itr1->second;
                for(auto j=itr2->second.begin();j!=itr2->second.end();j++){
                    t.insert(*j);
                }
                ans.push_back(t);
            }
        }
    }
    
    vector<ll> anst;
    REP(i,ans.size()){
        set<ll> t=ans[i];
        for(auto i=t.begin();i!=t.end();i++){
            anst.push_back(*i);
        }
    }
    
    REP(i,anst.size()-1){
        cout<<anst[i]<<" ";
    }
    cout<<anst[anst.size()-1]<<endl;
    
    return 0;
}