#include <cstdio>
#include <unordered_map>

using namespace std;

int a[105];
struct aux {
  int a, b, c;
};

unordered_map<int, aux>mp;

int main() {
  freopen("loto.in", "r", stdin);
  freopen("loto.out", "w", stdout);

  int n, s;
  scanf("%d%d", &n, &s);
  for (int i = 1; i <= n; ++i)
    scanf("%d", &a[i]);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k) {
        int s1 = a[i] + a[j] + a[k];
        mp[s1] = {a[i], a[j], a[k]};
        if (mp.find(s - s1) != mp.end()) {
          printf("%d %d %d %d %d %d", mp[s - s1].a, mp[s - s1].b, mp[s - s1].c, a[i], a[j], a[k]);
          return 0;
        }
      }
  printf("-1\n");
  return 0;
}