#include <bits/stdc++.h>
using namespace std;
int n;
long long k;
long long arr[2010];
long long res[2010];
long long modP(long long x, long long y, long long z) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = (ret * x) % z;
    x = (x * x) % z;
    y >>= 1;
  }
  return ret;
}
int C(long long a, long long b) {
  if (a == 0 || a == b) return 1;
  if (a > b) return 0;
  long long ret = 1;
  for (int i = b; i > b - a; i--) ret = (ret * i) % 1000000007LL;
  for (int i = a; i > 0; i--)
    ret = (ret * modP(i, 1000000007LL - 2, 1000000007LL)) % 1000000007LL;
  return ret;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < n; i++)
    for (int j = i; j < n; j++)
      res[j] = (res[j] + arr[j - i] * C(i, i + k - 1)) % 1000000007LL;
  for (int i = 0; i < n; i++) cout << res[i] << ' ';
  cout << endl;
  return 0;
}
