#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int maxn = 100005;
const long long mod = 1e9 + 7;
vector<long long> a, b;
int n, k;
vector<long long> calc(vector<long long>& s, vector<long long>& t) {
  vector<long long> tmp;
  tmp.resize(n + 1, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      tmp[i] += s[i - j] * t[j];
      tmp[i] %= mod;
    }
  }
  return tmp;
}
void pow_mod(long long p) {
  while (p) {
    if (p & 1) {
      a = calc(a, b);
    }
    b = calc(b, b);
    p >>= 1;
  }
}
int main() {
  scanf("%d %d", &n, &k);
  a.resize(n + 1), b.resize(n + 1);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]), b[i] = 1;
  pow_mod(k);
  for (int i = 0; i < n; i++) cout << a[i] << ' ';
  cout << endl;
  return 0;
}
