Problem: While most students still sit their exams, the tractor college has completed the summer exam session. In fact, students study only one subject at this college — the Art of Operating a Tractor. Therefore, at the end of a term a student gets only one mark, a three (satisfactory), a four (good) or a five (excellent). Those who score lower marks are unfortunately expelled.

The college has n students, and oddly enough, each of them can be on scholarship. The size of the scholarships varies each term. Since the end-of-the-term exam has just ended, it's time to determine the size of the scholarship to the end of next term.

The monthly budget for the scholarships of the Tractor college is s rubles. To distribute the budget optimally, you must follow these rules:

  * The students who received the same mark for the exam, should receive the same scholarship;
  * Let us denote the size of the scholarship (in roubles) for students who have received marks 3, 4 and 5 for the exam, as k3, k4 and k5, respectively. The values k3, k4 and k5 must be integers and satisfy the inequalities 0 ≤ k3 ≤ k4 ≤ k5;
  * Let's assume that c3, c4, c5 show how many students received marks 3, 4 and 5 for the exam, respectively. The budget of the scholarship should be fully spent on them, that is, c3·k3 + c4·k4 + c5·k5 = s;
  * Let's introduce function <image> — the value that shows how well the scholarships are distributed between students. In the optimal distribution function f(k3, k4, k5) takes the minimum possible value. 



Given the results of the exam, and the budget size s, you have to find the optimal distribution of the scholarship.

Input

The first line has two integers n, s (3 ≤ n ≤ 300, 1 ≤ s ≤ 3·105) — the number of students and the budget size for the scholarship, respectively. The second line contains n integers, where the i-th number represents the mark that the i-th student got for the exam. It is guaranteed that at each mark was given to at least one student.

Output

On a single line print three integers k3, k4 and k5 — the sought values that represent the optimal distribution of the scholarships. If there are multiple optimal answers, print any of them. If there is no answer, print -1.

Examples

Input

5 11
3 4 3 5 5


Output

1 3 3


Input

6 15
5 3 3 4 4 5


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int cnt[4];
int best_func = 1e9;
int best_k[3], s;
int p[303], pp[303];
inline int f(int k1, int k2, int k3) {
  return abs(cnt[1] * k1 - cnt[2] * k2) + abs(cnt[2] * k2 - cnt[3] * k3);
}
void upd(int k1, int k2, int k3) {
  if (k1 >= 0 and k2 >= k1 and k3 >= k2)
    if (f(k1, k2, k3) < best_func) {
      best_func = f(k1, k2, k3);
      best_k[0] = k1;
      best_k[1] = k2;
      best_k[2] = k3;
    }
}
int get_k3(int k1, int k2) { return (s - cnt[1] * k1 - cnt[2] * k2) / cnt[3]; }
inline int find_small(int idx, int val, bool high = false) {
  if (pp[idx] >= val) return pp[idx];
  int left = 0, right = 300500;
  while (right - left > 1) {
    int mid = (left + right) / 2;
    if (pp[idx] + p[idx] * mid > val)
      right = mid;
    else
      left = mid;
  }
  if (!high)
    return pp[idx] + p[idx] * left;
  else
    return pp[idx] + p[idx] * right;
}
inline int find_high(int idx, int val) { return find_small(idx, val, true); }
int main() {
  int n, cur;
  cin.sync_with_stdio(false);
  cin >> n >> s;
  for (int i = 0; i < n; i++) {
    cin >> cur;
    cnt[cur - 2]++;
  }
  for (int k = 0; k < 303; k++) {
    int cur = (s - cnt[2] * k) % cnt[3];
    pp[k] = 0;
    while (pp[k] < 303 and (cur - cnt[1] * pp[k]) % cnt[3]) pp[k]++;
    p[k] = 1;
    while (p[k] < 303 and (cur - cnt[1] * (pp[k] + p[k])) % cnt[3]) p[k]++;
  }
  int k = -1;
  for (int k2 = 0; (cnt[2] + cnt[3]) * k2 <= s; k2++) {
    k++;
    if (k == cnt[3]) k = 0;
    if (p[k] == 303 or pp[k] == 303) continue;
    int v = cnt[2] * k2 / cnt[1];
    int fs = find_small(k, v);
    int fh = find_high(k, v);
    v = min(k2, v);
    upd(fs, k2, get_k3(fs, k2));
    upd(fh, k2, get_k3(fh, k2));
    v = (s - 2 * cnt[2] * k2) / cnt[1];
    v = min(k2, v);
    fs = find_small(k, v);
    fh = find_high(k, v);
    upd(fs, k2, get_k3(fs, k2));
    upd(fh, k2, get_k3(fh, k2));
  }
  if (best_func == 1e9)
    cout << "-1";
  else
    for (int i = 0; i < 3; i++) cout << best_k[i] << " ";
  return 0;
}