#include <bits/stdc++.h>
using namespace std;
int n, w, a[101], ans[101];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> w;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    ans[i] = (a[i] + 1) / 2;
    w -= ans[i];
  }
  if (w < 0) {
    cout << -1 << '\n';
    return 0;
  }
  pair<int, int> p[101];
  for (int i = 1; i <= n; i++) {
    p[i] = {a[i], i};
  }
  sort(p + 1, p + n + 1);
  int foo;
  for (int i = n; i >= 1; i--) {
    foo = min(w, p[i].first - ans[p[i].second]);
    ans[p[i].second] += foo;
    w -= foo;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << '\n';
}
