#include <bits/stdc++.h>

using namespace std;

template<typename T> int least_bit(T n) {
  static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size");
  if (sizeof(T) == 4) return __builtin_ffs(n) - 1;
  if (sizeof(T) == 8) return __builtin_ffsll(n) - 1;
}

template<typename T> int most_bit(T n) {
  static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size");
  if (sizeof(T) == 4) return n ? 31 - __builtin_clz(n) : -1;
  if (sizeof(T) == 8) return n ? 63 - __builtin_clzll(n) : -1;
}

template<typename T> int count_bit(T n) {
  static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size");
  if (sizeof(T) == 4) return __builtin_popcount(n);
  if (sizeof(T) == 8) return __builtin_popcountll(n);
}

class BitIterator {
public:

  class Iterator {
  private:
    int val, bit;

  public:
    Iterator(int val, int bit) : val(val), bit(bit) {}

    Iterator operator*() {
      return *this;
    }

    bool operator!=(const Iterator& itr) const {
      return val != itr.val;
    }

    void operator++() {
      val = least_bit(bit & (-1 << (val + 1)));
    }

    operator int() {
      return val;
    }
  };
  
  Iterator i, n;
  int bit;

  BitIterator(int n) : i(least_bit(n), n), n(-1, n), bit(n) {}

  bool operator!=(const BitIterator& itr) const {
    return i != itr.i;
  }

  void operator++() {
    *this = BitIterator(bit + 1);
  }

  operator int() const {
    return bit;
  }

  bool in(int i) const {
    return bit & (1 << i);
  }

  Iterator& begin() {
    return i;
  }

  Iterator& end() {
    return n;
  }
};

class PowerSet {
private:
  class Iterator {
  private:
    BitIterator val;

  public:
    Iterator(int val) : val(val) {}

    Iterator operator*() {
      return *this;
    }

    bool operator!=(Iterator& itr) {
      return val != itr.val;
    }

    void operator++() {
      ++val;
    }

    operator int() const {
      return val;
    }

    bool in(int i) const {
      return val.in(i);
    }

    BitIterator::Iterator& begin() {
      return val.begin();
    }

    BitIterator::Iterator& end() {
      return val.end();
    }
  };

  Iterator i, n;

public:
  PowerSet(int n) : i(0), n(1 << n) {}

  Iterator& begin() {
    return i;
  }

  Iterator& end() {
    return n;
  }
};

template<typename T> string to_string(const T& v) {
  string str;
  for (const auto& i : const_cast<T&>(v)) str += to_string(i) + " ";
  return str.substr(0, max(0, (int)str.size() - 1));
}

vector<pair<int, vector<int>>> solve(const vector<int>& p) {
  vector<pair<int, vector<int>>> res;
  for (auto t : PowerSet(p.size())) {
    int sum = 0;
    vector<int> v;
    for (auto i : t) {
      sum += p[int(i)];
      v.emplace_back(i);
    }
    res.emplace_back(make_pair(sum, v));
  }
  return res;
}

int main() {
  int n, s;
  cin >> n >> s;
  vector<int> p(n / 2), q(n - n / 2);
  for (int& i : p) cin >> i;
  for (int& i : q) cin >> i;
  unordered_map<int, vector<vector<int>>> a;
  for (const auto& i : solve(p)) a[i.first].emplace_back(i.second);
  vector<vector<int>> res;
  for (const auto& i : solve(q)) {
    for (const auto& u : a[s - i.first]) {
      vector<int> vv;
      for (int j : u) vv.emplace_back(j + 1);
      for (int j : i.second) vv.emplace_back(j + n / 2 + 1);
      res.emplace_back(vv);
    }
  }
  sort(res.begin(), res.end());
  for (const auto& i : res) cout << to_string(i) << endl;
}