// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    long N, K;
    scan(N, K);
    auto A = aryread();
    auto ans = new long[][](K + 1, N + 1);
    ans[0][0 .. N][] = A[];
    foreach (i; 0 .. K)
    {
        foreach (j; 0 .. N)
        {
            ans[i + 1][max(0, j - ans[i][j])] += 1;
            ans[i + 1][min(j + ans[i][j] + 1, N)] += -1;
        }
        bool allN = true;
        foreach (j; 0 .. N)
        {
            allN = allN && ans[i + 1][j] == N;
            ans[i + 1][j + 1] += ans[i + 1][j];
        }
        if (allN)
        {
            // writeln(i);
            arywrite(ans[i + 1][0 .. N]);
            return;
        }
    }
    arywrite(ans[K][0 .. N]);
}
