#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const long long N = 2010;
const long long mod = 1e9 + 7;
long long g[N];
long long n, k;
long long a[N];
long long temp[N];
long long b[N];
bool flag;
void mul(long long a[], long long b[], long long c[]) {
  memset(temp, 0, sizeof temp);
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= i; j++)
      temp[i] = (temp[i] + a[j] * b[i - j + 1] % mod) % mod;
  for (long long i = 1; i <= n; i++) c[i] = temp[i];
}
signed main() {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  g[1] = 1;
  for (long long i = 1; i <= n; i++) b[i] = 1;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  while (k) {
    if (k & 1) mul(g, b, g);
    k >>= 1;
    mul(b, b, b);
  }
  for (long long i = 1; i <= n; i++) {
    long long x = 0;
    for (long long j = 1; j <= i; j++) x = (x + g[i - j + 1] * a[j]) % mod;
    cout << x << " ";
  }
  cout << endl;
  return 0;
}
