#include <bits/stdc++.h>
using namespace std;
int A[2010], C[2010][2010], trans[2010][2010], res[2010][2010];
int mul(int a, int b) {
  long long x = 1LL * a * b;
  if (x < 1000000007) return x;
  return x % 1000000007;
}
int add(int a, int b) {
  long long x = (a + b);
  if (x < 1000000007) return x;
  return x - 1000000007;
}
int n;
void mult(int A[2010][2010], int B[2010][2010]) {
  for (int i = 0; i < n; i++) {
    C[0][i] = 0;
    for (int j = 0; j <= i; j++) {
      C[0][i] = add(C[0][i], mul(B[j][i], A[0][j]));
    }
  }
  for (int i = 1; i < n; i++)
    for (int j = i; j < n; j++) {
      C[i][j] = C[i - 1][j - 1];
      A[i][j] = C[i][j];
    }
  for (int i = 0; i < n; i++) A[0][i] = C[0][i];
}
void expo(int A[2010][2010], int B[2010][2010], int k) {
  for (int i = 0; i < n; i++) B[i][i] = 1;
  while (k) {
    if (k & 1) mult(B, A);
    mult(A, A);
    k /= 2;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> A[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) trans[j][i] = 1;
  }
  expo(trans, res, k);
  for (int i = 0; i < n; i++) {
    int ans = 0;
    for (int j = 0; j < n; j++) {
      ans = add(ans, mul(A[j], res[j][i]));
    }
    cout << ans << " ";
  }
  cout << '\n';
}
