#include <bits/stdc++.h>
using namespace std;
const int N = 1e9 + 7;
long long a[2005];
int n, k;
vector<vector<long long> > mul(vector<vector<long long> > &A,
                               vector<vector<long long> > &B) {
  vector<vector<long long> > C(1, vector<long long>(n));
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++)
      C[0][i] = (C[0][i] + A[0][j] * B[0][i - j]) % N;
  return C;
}
vector<vector<long long> > pow(vector<vector<long long> > u, int k) {
  vector<vector<long long> > I(1, vector<long long>(n));
  I[0][0] = 1;
  while (k > 0) {
    if (k & 1) I = mul(I, u);
    u = mul(u, u);
    k >>= 1;
  }
  return I;
}
int main() {
  cin >> n >> k;
  int i, j;
  for (i = 0; i < n; i++) cin >> a[i];
  vector<vector<long long> > A(1, vector<long long>(n));
  for (i = 0; i < n; i++) A[0][i] = 1;
  vector<vector<long long> > b(1, vector<long long>(n));
  b = pow(A, k);
  cout << a[0] % N << " ";
  long long temp = 0;
  for (i = 1; i < n; i++) {
    temp = 0;
    for (j = 0; j <= i; j++) temp = (temp + a[j] * b[0][i - j]) % N;
    cout << temp << " ";
  }
  cout << endl;
  return 0;
}
