#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000, MOD = 1e9 + 7;
int n, K, a[maxn + 5], c[maxn + 5], INV[maxn + 5], ans[maxn + 5];
inline int C(int x, int y) {
  int ans = INV[y];
  for (int i = 1; i <= y; i++) ans = (long long)ans * (x - i + 1) % MOD;
  return ans;
}
inline void Make(int n) {
  INV[0] = INV[1] = 1;
  for (int i = 2; i <= n; i++)
    INV[i] = (long long)(MOD - MOD / i) * INV[MOD % i] % MOD;
  for (int i = 1; i <= n; i++) INV[i] = (long long)INV[i - 1] * INV[i] % MOD;
  for (int i = 0; i <= n; i++) c[i] = C(i + K - 1, i);
}
inline void AMOD(int &x, int tem) {
  if ((x += tem) >= MOD) x -= MOD;
}
int main() {
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (!K) {
    for (int i = 1; i <= n; i++)
      i < n ? printf("%d ", a[i]) : printf("%d\n", a[i]);
    return 0;
  }
  Make(n);
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) AMOD(ans[j], (long long)a[i] * c[j - i] % MOD);
  for (int i = 1; i <= n; i++)
    i < n ? printf("%d ", ans[i]) : printf("%d\n", ans[i]);
  return 0;
}
