#include <bits/stdc++.h>
using namespace std;
int n, w, i, k, m, s, t, mas[101], ans[101];
int main() {
  cin >> n >> w;
  for (i = 1; i <= n; i++) cin >> mas[i];
  for (i = 1; i <= n; i++) {
    ans[i] = (mas[i] + 1) / 2;
    w -= ans[i];
    if (w < 0) {
      cout << -1 << endl;
      return 0;
    }
  }
  while (w) {
    m = 0;
    for (i = 1; i <= n; i++)
      if (mas[i] > m) {
        m = mas[i];
        k = i;
      }
    if (w < mas[k] - ans[k]) {
      ans[k] += w;
      w = 0;
    } else {
      w -= mas[k] - ans[k];
      ans[k] = mas[k];
      mas[k] = 0;
    }
  }
  for (i = 1; i < n; i++) cout << ans[i] << " ";
  cout << ans[n] << endl;
}
