#include <bits/stdc++.h>
using namespace std;
const int N = 200;
vector<long long int> vc;
int main() {
  long long int n, k;
  vector<pair<int, int>> p;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    vc.push_back(x);
    p.emplace_back(x, i);
  }
  vector<int> ans;
  for (int i = 0; i < vc.size(); i++) {
    if (k < (vc[i] + 1) / 2) {
      cout << "-1" << endl;
      return 0;
    }
    ans.push_back((vc[i] + 1) / 2);
    k -= (vc[i] + 1) / 2;
  }
  sort(p.begin(), p.end());
  reverse(p.begin(), p.end());
  for (int i = 0; i < ans.size(); i++) {
    while (p[i].first > ans[p[i].second] && k) {
      k--;
      ans[p[i].second]++;
    }
  }
  for (auto x : ans) cout << x << " ";
}
