#include <bits/stdc++.h>
using namespace std;
int ntest = 0, test = 0;
inline void init();
inline void run();
inline void stop() { ntest = test - 1; }
int main() {
  init();
  while (++test <= ntest) {
    run();
  }
  return 0;
}
const int INF = (int)1E9 + 5;
const double EPS = 1E-11;
const long long MOD = (long long)1E9 + 7;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
inline void init() { ntest = 1; }
long long mu(long long a, long long n) {
  long long rs = 1;
  for (; n; n >>= 1) {
    if (n & 1) rs = (rs * a) % MOD;
    a = (a * a) % MOD;
  }
  return rs;
}
vector<int> a;
inline void run() {
  int n, k;
  cin >> n >> k;
  a.resize(n);
  for (int i = 0; i < (n); i++) cin >> a[i];
  if (k == 0) {
    for (int i = 0; i < (n); i++) cout << a[i] << " ";
    return;
  }
  for (int i = 0; i < (n); i++) {
    long long total = a[i];
    long long cur = 1;
    for (int j = (1); j <= (i); j++) {
      cur = (cur * (k + j - 1)) % MOD;
      cur = (cur * mu(j, MOD - 2)) % MOD;
      total = (total + (cur * a[i - j]) % MOD) % MOD;
    }
    cout << total << " ";
  }
}
