#include <bits/stdc++.h>
#pragma GCC optimize("03")
 
using namespace std;
 
ifstream fin("loto.in");
ofstream fout ("loto.out");
 
typedef long long ll;
 
#define f first
#define s second
#define pb push_back
 
struct hatz{
  int a, b, c;
};
ll v[102], n, s;
unordered_map<ll, hatz>mp;
 
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  fin >> n >> s;
  for (int i = 1; i <= n; i++)
    fin >> v[i];
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++)
      for (int k = j; k <= n; k++) {
        mp[v[i] + v[j] + v[k]] = {i, j, k};
        if (mp.find(s - v[i] - v[j] - v[k]) != mp.end()) {
          ll val = s - v[i] - v[j] - v[k];
          fout << v[i] << " " << v[j] << " " << v[k] << " " << v[mp[val].a] << " " << v[mp[val].b] << " " << v[mp[val].c] << "\n";
          return 0;
        }
      }
  fout << -1;
  return 0;
}