#include <bits/stdc++.h>
using namespace std;
int N, k;
vector<int> mult(vector<int> &a, vector<int> &b) {
  vector<int> r(2100);
  int i, j;
  long long t;
  for (i = 0; i < N; ++i) {
    t = 0;
    for (j = 0; j < N; ++j)
      t += ((a[j]) * 1LL * ((i - j >= 0 ? b[i - j] : 0))) % 1000000007;
    r[i] = t % 1000000007;
  }
  return r;
}
vector<int> pow(vector<int> m, int b) {
  vector<int> r(2100);
  int i;
  for (i = 0; i < N; ++i) r[i] = 0;
  r[0] = 1;
  while (b) {
    if (b & 1) {
      --b;
      r = mult(r, m);
    } else {
      m = mult(m, m);
      b >>= 1;
    }
  }
  return r;
}
int main() {
  cin >> N >> k;
  int i;
  vector<int> m(2100);
  for (i = 0; i < N; ++i) cin >> m[i];
  if (k == 0) {
    for (i = 0; i < N; ++i) cout << m[i] << " ";
    return 0;
  }
  vector<int> mm(2100);
  for (i = 0; i < N; ++i) mm[i] = 1;
  mm = pow(mm, k);
  long long a;
  for (i = 0; i < N; ++i) {
    a = 0;
    for (int j = 0; j < N; ++j)
      a += (m[j] * 1LL * (i - j >= 0 ? mm[i - j] : 0)) % 1000000007;
    cout << a % 1000000007 << " ";
  }
  return 0;
}
