#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e2 + 10;
pair<long long, long long> a[MAXN];
long long b[MAXN];
long long res[MAXN];
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  long long n, w;
  cin >> n >> w;
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  for (long long i = 0; i < n; i++) {
    b[i] = ceil(a[i].first / ((long double)(2)));
    w -= b[i];
    if (w < 0) {
      cout << -1;
      return 0;
    }
  }
  long long y = n - 1;
  while (y >= 0) {
    if (w > (a[y].first - b[y])) {
      w -= (a[y].first - b[y]);
      b[y] = a[y].first;
    } else {
      b[y] += w;
      w = 0;
    }
    y--;
  }
  for (long long i = 0; i < n; i++) {
    res[a[i].second] = b[i];
  }
  for (long long i = 0; i < n; i++) {
    cout << res[i] << " ";
  }
}
