#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N, S; cin >> N >> S;
  ll P[N]; rep(i,N) cin >> P[i];
  map<ll, vector<ll>> left, right;
  rep(i,1<<N/2) {
    ll now = 0;
    rep(j,N/2) if (i&(1<<j)) now += P[j];
    left[now].push_back(i);
  }
  rep(i,1<<(N-N/2)) {
    ll now = 0;
    rep(j,N-N/2) if (i&(1<<j)) now += P[j+N/2];
    right[now].push_back(i);
  }
  // for (auto x: left) cout << x.first << " "; cout << endl;

  vector<vector<ll>> result;
  for (auto x: left) {
    if (right.count(S-x.first)) {
      vector<ll> l_vec = x.second, r_vec = right[S-x.first];
      for (auto l: l_vec) for (auto r: r_vec) {
        vector<ll> tres(N,0);
        rep(i,N/2) if (l&(1<<i)) tres[i] = 1;
        rep(i,N-N/2) if (r&(1<<i)) tres[N/2+i] = 1;
        result.push_back(tres);
      }
    }
  }
  sort(all(result),greater<vector<ll>>());
  for (auto x: result) {
    rep(i,N) if (x[i]) cout << i+1 << " ";
    cout << endl;
  }
  return 0;
}