#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& o, const pair<T1, T2> p) {
  o << "(" << p.first << ":" << p.second << ")";
  return o;
}
namespace {
std::chrono::system_clock::time_point ttt;
void tic() { ttt = chrono::system_clock::now(); }
void toc() {
  fprintf(stderr, "TIME : %lldms\n",
          (chrono::duration_cast<chrono::milliseconds>(
               chrono::system_clock::now() - ttt)
               .count()));
}
std::chrono::system_clock::time_point tle = chrono::system_clock::now();
}  // namespace
namespace {
class MaiScanner {
 public:
  template <typename T>
  void input_integer(T& var) {
    var = 0;
    T sign = 1;
    int cc = getchar();
    for (; cc < '0' || '9' < cc; cc = getchar())
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() { return getchar(); }
  inline MaiScanner& operator>>(int& var) {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner& operator>>(long long& var) {
    input_integer<long long>(var);
    return *this;
  }
};
}  // namespace
MaiScanner scanner;
int n, w;
int aa[110];
int cup[110];
int sorted[110];
int main() {
  scanner >> n >> w;
  for (auto cnt = 0; cnt < (n); ++cnt) {
    scanner >> aa[cnt];
  }
  for (auto cnt = 0; cnt < (n); ++cnt) {
    cup[cnt] = (aa[cnt] + 1) / 2;
    w -= cup[cnt];
    sorted[cnt] = cnt;
  }
  if (w < 0) {
    cout << -1 << endl;
    return 0;
  }
  sort(sorted, sorted + n, [](int l, int r) { return aa[l] > aa[r]; });
  for (auto cnt = 0; cnt < (n); ++cnt) {
    int i = sorted[cnt];
    int f = min(aa[i] - cup[i], w);
    cup[i] += f;
    w -= f;
    if (w < 0) break;
  }
  for (auto cnt = 0; cnt < (n); ++cnt) {
    cout << cup[cnt] << " ";
  }
  cout << endl;
  return 0;
}
