#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
const int mod = 1e9 + 7;
int n, K, a[N], c[N], jc[N], cc[N];
long long ni(long long x) {
  long long s = 1;
  int y = mod - 2;
  x %= mod;
  while (y) {
    if (y & 1) s = s * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return s;
}
void init() {
  int i;
  for (i = 1, jc[0] = 1; i <= n; i++) jc[i] = (long long)jc[i - 1] * i % mod;
  cc[0] = 1;
  for (i = K + 1; i <= K + n; i++)
    cc[i - K] = (long long)cc[i - K - 1] * i % mod;
  for (i = 0; i <= n; i++) c[i] = (long long)cc[i] * ni(jc[i]) % mod;
}
void iWork() {
  cin >> n >> K;
  K--;
  int i, j;
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (K == -1) {
    for (i = 1; i <= n; i++) printf("%d\n", a[i]);
    return;
  }
  init();
  for (i = 1; i <= n; i++) {
    long long ans = 0;
    for (j = 1; j <= i; j++) {
      (ans += (long long)a[j] * c[i - j] % mod) %= mod;
    }
    printf("%d ", ans);
  }
}
int main() {
  iWork();
  return 0;
}
