#include <cstdio>
#include <unordered_map>

using namespace std;

int a[105];
unordered_map<int, bool>mp;

void afis(int n, int s) {
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k)
        if (a[i] + a[j] + a[k] == s) {
          printf("%d %d %d ", a[i], a[j], a[k]);
          return ;
        }
}

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] = 1;
        if (mp[s - s1] == 1) {
          afis(n, s1);
          afis(n, s - s1);
          return 0;
        }
      }
  printf("-1\n");
  return 0;
}