#include <bits/stdc++.h>
using namespace std;

template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template <typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
using i64 = long long int;

const int INF = INT_MAX, MOD = 1e9 + 7;
const long long LINF = LLONG_MAX;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {0, 0, 0, -1, 1, -1, 1, 1, -1};
const int dy[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};

int main() {
  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

  ifstream cin("loto.in");
  ofstream cout("loto.out");

  int N; cin >> N;
  i64 S; cin >> S;
  vector<i64> nums(N);
  for (int i = 0; i < N; i++)
    cin >> nums[i];

  map<i64, pair<i64, i64>> duo_sum;
  map<i64, pair<i64, pair<i64, i64>>> trio_sum;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      if (duo_sum.find(nums[i] + nums[j]) == duo_sum.end())
        duo_sum[nums[i] + nums[j]] = {nums[i], nums[j]};

      for (int k = 0; k < N; k++) {
        if (trio_sum.find(nums[i] + nums[j] + nums[k]) == trio_sum.end())
          trio_sum[nums[i] + nums[j] + nums[k]] = {nums[i], {nums[j], nums[k]}};
      }
    }
  }

  vector<i64> ans;
  bool done = false;
  for (auto &[sum1, pair1]: duo_sum) {
    for (int i = 0; i < N; i++) {
      if (trio_sum.find(S - sum1 - nums[i]) != trio_sum.end()) {
        ans.push_back(pair1.first);
        ans.push_back(pair1.second);
        ans.push_back(nums[i]);
        auto &pair3 = trio_sum[S - sum1 - nums[i]];
        ans.push_back(pair3.first);
        ans.push_back(pair3.second.first);
        ans.push_back(pair3.second.second);
        done = true;
        break;
      }
    }

    if (done) break;
  }

  if ((int) ans.size() != 0) {
    sort(ans.begin(), ans.end());
    for (auto x: ans)
      cout << x << " ";
  } else {
    cout << -1 << "\n";
  }

  return 0;
}