#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2005;
long long coe[maxn];
int data[maxn];
long long ans[maxn];
int n, k;
long long inv(long long s) {
  int n = mod - 2;
  long long ret = 1;
  for (; n; n >>= 1) {
    if (n & 1) ret = ret * s % mod;
    s = s * s % mod;
  }
  return ret;
}
void init() {
  coe[0] = 1;
  long long now = k;
  for (int i = 1; i <= n + 1; ++i) {
    coe[i] = coe[i - 1] * now++ % mod;
    coe[i] = coe[i] * inv(i) % mod;
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) scanf("%d", data + i);
  if (k == 0) {
    for (int i = 0; i < n; ++i) {
      if (i) putchar(' ');
      printf("%d", data[i]);
    }
    puts("");
    return 0;
  }
  init();
  for (int i = 0; i < n; ++i) {
    for (int j = i, t = 0; j < n; ++j) {
      ans[j] += coe[t++] * data[i] % mod;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i) putchar(' ');
    printf("%I64d", ans[i] % mod);
  }
  puts("");
  return 0;
}
