#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int R = 15;
int N;
ll S, P[31];

vll calc(int l, int r){
    int n = r - l;
    vll res(1ll << n);
    rep(mask, 1 << n){
        ll sm = 0;
        rep(i, n)if(mask>>i&1){
            sm += P[l + i];
        }
        res[mask] = sm;
    }
    return res;
}

int main(){
    cin >> N >> S;
    rep(i, N)cin >> P[i];
    vector<vi> ans;
    if(N <= R){
        vll sums = calc(0, N);
        rep(i, 1 << N)if(sums[i]==S){
            vi a;
            rep(j, N)if(i >> j & 1)a.push_back(j);
            ans.push_back(a);
        }
    } else{
        // [0, R), [R, N)
        vll sumsL = calc(0, R), sumsR = calc(R, N);
        map<ll, vi> flagsL, flagsR;
        rep(i, sz(sumsL))flagsL[sumsL[i]].push_back(i);
        rep(i, sz(sumsR))flagsR[sumsR[i]].push_back(i<<R);
        each(p, flagsL){
            ll sumL = p.first;
            if(flagsR.count(S - sumL)){
                auto & frs = flagsR[S-sumL];
                each(fl, p.second)each(fr, frs){
                    vi a;
                    rep(i, R)if(fl >> i & 1)a.push_back(i);
                    FOR(i, R, N)if(fr >> i & 1)a.push_back(i);
                    ans.push_back(a);
                }
            }
        }
    }

    sort(all(ans));
    each(a, ans){
        rep(i, sz(a))printf("%d%c", a[i]+1, i != sz(a) - 1 ? ' ' : '\n');
    }
}