#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = LLONG_MAX;
const long long ninf = LLONG_MIN;
const long double eps = 1e-12;
const long long N = 1000005;
const long long LOGN = 19;
long long n, k;
long long a[N], ans[N], C[N];
long long power(long long a, long long b) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y);
      if (x > mod) x %= mod;
    }
    y = (y * y);
    if (y > mod) y %= mod;
    b /= 2;
  }
  return x;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  C[0] = 1;
  for (int i = 1; i <= n; i++) {
    C[i] = C[i - 1] * (k + i - 1) % mod * power(i, mod - 2) % mod;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i + 1; j++) {
      if (k - 1 <= k + i - j) {
        ans[i] = (ans[i] + C[i - j] * a[j]) % mod;
      }
    }
  }
  for (int i = 0; i < n; i++) cout << (k ? ans[i] : a[i]) << " ";
  cout << "\n";
  return 0;
}
