#include <bits/stdc++.h>
using namespace std;
const int N = 2010, mod = 1e9 + 7;
int c[N], a[N], s[N], f1[N], t[N];
void mul(int c[], int a[], int b[]) {
  memset(t, 0, sizeof t);
  for (int i = 1; i < N; i++)
    for (int k = 1; k <= i; k++)
      t[i] = (t[i] + (long long)a[k] * b[i - k + 1] % mod) % mod;
  for (int i = 1; i < N; i++) c[i] = t[i];
}
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> c[i];
  if (k == 0) {
    for (int i = 1; i <= n; i++) cout << c[i] << " ";
    return 0;
  }
  k--;
  for (int i = 1; i < N; i++) f1[i] = 1;
  for (int i = 1; i < N; i++) a[i] = 1;
  while (k) {
    if (k & 1) mul(f1, f1, a);
    mul(a, a, a);
    k >>= 1;
  }
  int t[N];
  memset(t, 0, sizeof t);
  for (int i = 1; i < N; i++)
    for (int k = 1; k <= i; k++)
      t[i] = (t[i] + (long long)c[k] * f1[i - k + 1] % mod) % mod;
  for (int i = 1; i <= n; i++) cout << t[i] << " ";
}
