#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, S;
  cin >> N >> S;
  vector<int> P(N);
  for (int i = 0; i < N; i++) {
    cin >> P[i];
  }
  function<void(int, int, int64_t, int, map<int, vector<int64_t>> &)> dfs =
      [&](int now, int end, int64_t items, int money, map<int, vector<int64_t>> &mp) {
        if (now == end) {
          mp[money].emplace_back(items);
          return;
        }
        dfs(now + 1, end, items | (INT64_C(1) << now), money + P[now], mp);
        dfs(now + 1, end, items, money, mp);
      };
  map<int, vector<int64_t>> A, B;
  dfs(0, N / 2, 0, 0, A);
  dfs(N / 2, N, 0, 0, B);
  vector<int64_t> res;
  for (auto itr = A.begin(); itr != A.end(); itr++) {
    int p = S - itr->first;
    if (!B[p].empty()) {
      for (int i = 0; i < (int)itr->second.size(); i++) {
        for (int j = 0; j < (int)B[p].size(); j++) {
          res.emplace_back(itr->second[i] | B[p][j]);
        }
      }
    }
  }
  vector<vector<int>> C((int)res.size());
  for (int k = 0; k < (int)res.size(); k++) {
    for (int i = 0; i < N; i++) {
      if ((res[k] >> i) & 1) C[k].emplace_back(i + 1);
    }
  }
  sort(C.begin(), C.end());
  for (int i = 0; i < (int)C.size(); i++) {
    for (auto &v : C[i]) {
      cout << v << (&v == &C[i].back() ? '\n' : ' ');
    }
  }
  return 0;
}