// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll S;
  cin >> n >> S;
  vector<ll> p(n);
  rep(i, n)cin >> p[i];
  map<ll, vector<int> > mp;
  int m = n - n / 2;
  for(int i = 0; i < (1 << m); i++){
    ll sum = 0;
    for(int j = 0; j < m; j++){
      if((i >> j) % 2 == 1)sum += p[n/2 + j];
    }
    mp[sum].pb(i);
  }
  int k = n / 2;
  vector<vector<int> > res;
  for(int i = 0; i < (1 << k); i++){
    ll sum = 0;
    for(int j = 0; j < k; j++){
      if((i >> j) % 2 == 1)sum += p[j];
    }
    for(auto st: mp[S - sum]){
      vector<int> ans;
      for(int j = 0; j < k; j++){
        if((i >> j) % 2 == 1)ans.pb(j);
      }
      for(int j = 0; j < m; j++){
        if((st >> j) % 2 == 1)ans.pb(j + n / 2);
      }
      res.pb(ans);
    }
  }
  sort(all(res));
  rep(i, sz(res)){
    rep(j, sz(res[i]))cout << res[i][j] + 1 << "\n "[j + 1 != sz(res[i])];
  }
	return 0;
}