#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,S; cin >> N >> S;
    vector<int> P(N);
    rep(i,N) cin >> P[i];

    int N0 = N / 2, N1 = N - N0;
    vector<int> P0, P1;
    rep(i,N0) P0.push_back(P[i]);
    rep(i,N1) P1.push_back(P[N0 + i]);

    auto f = [&](vector<int> A) {
        int N = A.size();
        map<int,vector<int>> mp;
        rep(S,1<<N) {
            int sum = 0;
            rep(i,N) if(S & (1 << i)) sum += A[i];
            mp[sum].push_back(S);
        }
        return mp;
    };

    auto mp0 = f(P0), mp1 = f(P1);
    vector<vector<int>> ans;
    for(auto [s0, v0] : mp0) {
        auto v1 = mp1[S - s0];
        for(int a0 : v0) for(int a1 : v1) {
            vector<int> a;
            rep(i,N0) if(a0 & (1 << i)) a.push_back(i + 1);
            rep(i,N1) if(a1 & (1 << i)) a.push_back(N0 + i + 1);
            ans.push_back(a);
        }
    }

    sort(ans.begin(), ans.end());
    for(auto v : ans) rep(i,int(v.size())) cout << v[i] << " \n"[i == int(v.size()) - 1];
}