#include <bits/stdc++.h>
using namespace std;
long long n, k, a[2005];
long long p[2005];
long long inmod(long long x) {
  long long r = 1;
  for (long long y = 1000000007 - 2;;) {
    if (y & 1) r = (r * x) % 1000000007;
    if (y >>= 1)
      x = (x * x) % 1000000007;
    else
      break;
  }
  return r;
}
int main() {
  scanf("%I64d%I64d", &n, &k);
  long long i, j;
  for (i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  for (i = 1; i <= n; i++) {
    if (k == 0) {
      printf("%I64d ", a[i]);
      continue;
    }
    long long r = 0;
    for (j = i; j >= 1; j--) p[j] = p[j - 1];
    p[1] = (p[2] * (k + i - 2)) % 1000000007;
    long long Q = inmod(i - 1);
    p[1] = (p[1] * Q) % 1000000007;
    if (!p[1] && i == 1) p[1] = 1;
    for (j = 1; j <= i; j++) {
      r = (r + (p[j] * a[j]) % 1000000007) % 1000000007;
    }
    printf("%I64d ", r);
  }
}
