#include <bits/stdc++.h>
using namespace std;
const unsigned long long MOD = 1e9 + 7;
unsigned long long quick_pow(unsigned long long num, unsigned long long p) {
  unsigned long long ans = 1;
  if (p == 0) {
    return 1ull;
  }
  if (p == 1ull) {
    return num;
  }
  if (p & 1ull) {
    ans = num;
    p--;
  }
  unsigned long long res = quick_pow(num, p >> 1);
  ans = ans * res % MOD * res % MOD;
  return ans;
}
inline unsigned long long inv(unsigned long long num) {
  return quick_pow(num, MOD - 2);
}
inline unsigned long long C(unsigned long long n, unsigned long long m) {
  unsigned long long ans = 1;
  if (n < m) {
    return 1;
  }
  if (m > n - m) {
    m = n - m;
  }
  for (int i = 1; i <= m; i++) {
    ans = ans * inv(i) % MOD * (n - i + 1) % MOD;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  unsigned long long n, k;
  cin >> n >> k;
  unsigned long long ans = 0, a[2048], b[2048];
  b[0] = 1;
  for (unsigned long long i = 0; i < n; i++) {
    cin >> a[i];
    ans = 0;
    b[i + 1] = b[i] * (k + i) % MOD * inv(i + 1) % MOD;
    for (int j = 0; j <= i; j++) {
      ans = ans + a[j] * b[i - j] % MOD;
    }
    cout << ans % MOD << " ";
  }
  cout << endl;
  return 0;
}
