#include <bits/stdc++.h>
using namespace std;
long long a[10000];
long long mod = 1000000007;
long long ans[10000];
long long c[10000];
long long k, n;
long long ext_gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long resu = ext_gcd(b, a % b, x, y);
  long long temp = x;
  x = y;
  y = temp - a / b * y;
  return resu;
}
long long Inv(long long a, long long b) {
  long long resu, temp;
  ext_gcd(a, b, resu, temp);
  resu = (resu % b + b) % b;
  return resu;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  c[0] = 1;
  for (long long i = 1; i < n; i++)
    c[i] = c[i - 1] * (i + k - 1) % mod * Inv(i, mod) % mod;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j <= i; j++) {
      ans[i] += a[i - j] * c[j] % mod;
    }
  for (int i = 0; i < n; i++) cout << ans[i] % mod << " ";
  cout << endl;
  return 0;
}
