#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 100000;

int u[N];
i64 pw[60];
struct Node {
  int i, v;
  bool operator< (const Node &a) const {
    if (v > a.v) {
      return u[i] != u[a.i] * pw[v - a.v] ? u[i] < u[a.i] * pw[v - a.v] : (a.v == 0 ? 1 : (u[i] != u[a.i] ? u[i] < u[a.i] : i > a.i));
    }
    return u[a.i] != u[i] * pw[a.v - v] ? u[a.i] > u[i] * pw[a.v - v] : (v == 0 && a.v != 0 ? 0 : (u[i] != u[a.i] ? u[i] < u[a.i] : i > a.i));
  }
};

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  pw[0] = 1;
  for (int i = 1; i < 60; i++) {
    pw[i] = pw[i - 1] * 2;
  }

  int T, H; 
  std::cin >> T >> H;

  for (int i = 0; i < T; i++) {
    std::cin >> u[i];
  }

  int k = 0;
  while (k * T + T * 30 < H) {
    k++;
  }

  std::vector<int> ans(T);
  std::priority_queue<Node> h;
  for (int i = 0; i < T; i++) {
    ans[i] += k;
    h.push({i, k});
  }
  H -= T * k;

  while (H > 0) {
    auto [i, k] = h.top();
    h.pop();
    ans[i]++;
    H--;
    h.push({i, k + 1});
  }
  for (int i = 0; i < T; i++) {
    std::cout << ans[i] << " \n"[i == T - 1];
  }

  return 0;
}