#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename T>
struct BIT
{
  int n;            // 要素数
  vector<T> bit[2]; // データの格納先
  BIT(int n_) { init(n_); }
  void init(int n_)
  {
    n = n_ + 1;
    for (int p = 0; p < 2; p++)
      bit[p].assign(n, 0);
  }

  void add_sub(int p, int i, T x)
  {
    for (int idx = i; idx < n; idx += (idx & -idx))
    {
      bit[p][idx] += x;
    }
  }
  void add(int l, int r, T x)
  { // [l,r) に加算
    add_sub(0, l, -x * (l - 1));
    add_sub(0, r, x * (r - 1));
    add_sub(1, l, x);
    add_sub(1, r, -x);
  }

  T sum_sub(int p, int i)
  {
    T s(0);
    for (int idx = i; idx > 0; idx -= (idx & -idx))
    {
      s += bit[p][idx];
    }
    return s;
  }
  T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }
};

void solve()
{
  int N, k;
  cin >> N >> k;
  vector<int> a(N);
  repi(i, N) cin >> a[i];
  //repi(i, N) a[i] = 0;
  BIT<int> sg(N);
  BIT<int> sg2(N);
  repi(i, N)
  {
    sg.add(i + 1, i + 2, a[i]);
  }
  int cnt = 0;
  repi(ki, k)
  {
    if (ki % 2 == 0)
    {
      for (int p = 0; p < 2; p++)
        sg2.bit[p].assign(sg2.n, 0);
      repi(i, N)
      {
        int ai = sg.sum(i + 1) - sg.sum(i);
        int l = max(1, i - ai + 1);
        int r = min(N + 1, i + ai + 2);
        sg2.add(l, r, 1);
      }
      bool same = true;
      REPI(j, 1, N + 2)
      {
        if (sg.sum(j) != sg2.sum(j))
        {
          same = false;
          break;
        }
      }
      if (same)
        break;
    }
    else
    {
      for (int p = 0; p < 2; p++)
        sg.bit[p].assign(sg.n, 0);
      repi(i, N)
      {
        int ai = sg2.sum(i + 1) - sg2.sum(i);
        int l = max(1, i - ai + 1);
        int r = min(N + 1, i + ai + 2);
        sg.add(l, r, 1);
      }
      bool same = true;
      REPI(j, 1, N + 2)
      {
        if (sg.sum(j) != sg2.sum(j))
        {
          same = false;
          break;
        }
      }
      if (same)
        break;
    }
    cnt ^= 1;
  }
  if (cnt == 0)
  {
    repi(i, N) cout << sg.sum(i + 1) - sg.sum(i) << (i == N - 1 ? "\n" : " ");
  }
  else
  {
    repi(i, N) cout << sg2.sum(i + 1) - sg2.sum(i) << (i == N - 1 ? "\n" : " ");
  }
}

int main()
{
  init_main();
  solve();
  return 0;
}


Measured memory_bytes: 7108