#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int r[2000] = {0, 1};
int cnk(int n, int k) {
  if (k <= 0) return 1;
  int zn = 1;
  for (int i = 1; i <= k; ++i)
    zn = (((1LL * zn * (n - i + 1)) % mod) * r[i]) % mod;
  return zn;
}
int main() {
  int n, k, a[2000], c[2000];
  scanf("%d%d", &n, &k);
  for (int i = 2; i < n; ++i) r[i] = (mod - (mod / i) * r[mod % i] % mod) % mod;
  for (int i = 0; i < n; ++i) c[i] = cnk(k + n - i - 2, n - 1 - i);
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    int res = 0;
    for (int j = 0; j <= i; ++j)
      res = (res + 1LL * c[n - 1 - i + j] * a[j]) % mod;
    printf("%d ", res);
  }
  printf("\n");
  return 0;
}
