#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
const int N = 105;
vector<pair<int, int>> arr;
bool comp(pair<int, int> &a, pair<int, int> &b) { return a.first >= b.first; }
int final[N];
int main() {
  int n, w;
  scanf("%d %d", &n, &w);
  arr.resize(n);
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    arr[i].first = x;
    arr[i].second = i;
  }
  sort(arr.begin(), arr.end());
  for (int i = n - 1; i >= 0; i--) {
    int tot = (int)ceil((double)arr[i].first / 2);
    final[arr[i].second] += tot;
    w -= tot;
  }
  if (w < 0) {
    puts("-1");
    return 0;
  }
  if (w > 0)
    for (int i = n - 1; i >= 0 && w > 0; i--) {
      int tot = arr[i].first - final[arr[i].second];
      if (w >= tot)
        final[arr[i].second] += tot;
      else {
        final[arr[i].second] += w;
        break;
      }
      w -= tot;
    }
  for (int i = 0; i < n; i++) printf("%d ", final[i]);
  puts("");
  return 0;
}
