import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readLong();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt() + 1;
      }
      
      debug {
        auto js = iota(N).array;
        auto as = A.dup;
        foreach (h; 0 .. 100) {
          writeln(h, " ", js, " ", as);
          js = js[1 .. as[0]] ~ js[0] ~ js[as[0] .. $];
          as = as[1 .. as[0]] ~ as[0] ~ as[as[0] .. $];
        }
      }
      
      int[] calc(int i, long k) {
        if (i == N) {
          return [];
        } else {
          const m = A[i] - i;
          auto js = [i] ~ calc(i + 1, k / m * (m - 1));
          foreach (_; 0 .. k % m) {
            const l = A[js[0]] - i;
            js = js[1 .. l] ~ js[0] ~ js[l .. $];
          }
          debug {
            writeln("calc ", i, " ", k, " = ", js);
          }
          return js;
        }
      }
      
      const ans = calc(0, K);
      foreach (i; 0 .. N) {
        if (i > 0) write(" ");
        write(A[ans[i]] - 1);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}