#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10, NX = 1e9 + 7;
int n, k, r, A[N], C[N], P[N], I[N];
int Power(int a, int b) {
  if (b == 0) return (1);
  int tmp = Power(a, b / 2);
  tmp = (1ll * tmp * tmp) % NX;
  if (b & 1) tmp = (1ll * tmp * a) % NX;
  return (tmp);
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &A[i]);
  I[0] = C[0] = r = 1;
  for (int i = 1; i <= n; i++) I[i] = (1ll * I[i - 1] * i) % NX;
  I[n] = Power(I[n], NX - 2);
  for (int i = n - 1; i >= 1; i--) I[i] = (1ll * I[i + 1] * (i + 1)) % NX;
  for (int i = 1; i < n; i++)
    r = (1ll * r * (k + i - 1)) % NX, C[i] = (1ll * r * I[i]) % NX;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++) P[i] = (P[i] + 1ll * C[i - j] * A[j]) % NX;
  for (int i = 0; i < n; i++) printf("%d ", P[i]);
  return (0);
}
