#include <bits/stdc++.h>
using namespace std;
int n, k;
int data[2005];
static inline int mult(long long int a, long long int b) {
  long long res = (a * b) % 1000000007;
  return res;
}
static inline int inverse(long long a) {
  long long ans = 1;
  while (a > 1) {
    long long k = 1000000007 / a + 1;
    a = k * a - 1000000007;
    ans = mult(ans, k);
  }
  return ans;
}
long long koef[2004];
int ans[2004];
int main() {
  for (int i = 1; i <= 2001; i++) {
  }
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &data[i]);
  }
  if (k > 0) {
    koef[0] = 1;
    for (int i = 1; i < n; i++) {
      koef[i] = mult(mult(koef[i - 1], k + i - 1), inverse(i));
    }
    for (int i = 0; i < n; i++) {
    }
    for (int i = 0; i < n; i++) {
      ans[i] = data[i];
      for (int j = 1; j <= i; j++) {
        ans[i] = (ans[i] + mult(data[i - j], koef[j])) % 1000000007;
      }
    }
  } else {
    memcpy(ans, data, sizeof(ans));
  }
  printf("%d", ans[0]);
  for (int i = 1; i < n; i++) printf(" %d", ans[i]);
  printf("\n");
  return 0;
}
