#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, w;
  cin >> n >> w;
  int a[100];
  vector<int> V;
  pair<int, int> S[100];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    V.push_back((a[i] + 1) / 2);
    w -= (a[i] + 1) / 2;
    if (w < 0) {
      cout << -1;
      return 0;
    }
    S[i] = make_pair(a[i], i);
  }
  sort(S, S + n);
  int k = n - 1;
  while (w > 0) {
    int i = S[k].second;
    if (V[i] < a[i]) {
      V[i]++;
      w--;
    }
    k--;
    if (k < 0) k = n - 1;
  }
  for (int i = 0; i < n; i++) cout << V[i] << ' ';
}
