#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
int n, k;
long long A[2020], v[2020], T[2020];
void mult(long long A[2020], long long v[2020], long long r[2020]) {
  long long aux[2020];
  for (int i = 0; i < n; i++) {
    aux[i] = 0LL;
    for (int j = 0; j <= i; j++) {
      if (!j)
        aux[i] = (aux[i] + A[i] * v[j]) % mod;
      else
        aux[i] = (aux[i] + A[i - j] * v[j]) % mod;
    }
  }
  for (int i = 0; i < n; i++) r[i] = aux[i];
  return;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> A[i];
  T[0] = 1LL;
  for (int i = 1; i < n; i++) T[i] = 0LL;
  for (int i = 0; i < n; i++) v[i] = 1LL;
  for (; k; k /= 2) {
    if (k & 1) mult(T, v, T);
    mult(v, v, v);
  }
  mult(T, A, A);
  for (int i = 0; i < n; i++) {
    if (i) cout << " ";
    cout << A[i];
  }
  cout << endl;
  return 0;
}
