#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
long long arr[100009], comb[100009];
long long mod(long long x) { return (x % 1000000007); }
long long Fe(int x, int y) {
  if (!y) return 1LL;
  long long h = Fe(x, y / 2);
  h = mod(h * h);
  if (y & 1) h = mod(h * x);
  return h;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%lld", arr + i);
  if (k == 0) {
    for (int i = 1; i <= n; i++) printf("%lld ", arr[i]);
    printf("\n");
    return 0;
  }
  if (k == 1) {
    for (int i = 1; i <= n; i++) {
      arr[i] = mod(arr[i] + arr[i - 1]);
      printf("%lld ", arr[i]);
    }
    printf("\n");
    return 0;
  }
  long long C = 1, cnt = 1;
  for (int i = k - 1; i <= (k - 1) + n; i++) {
    comb[cnt] = C;
    C = mod(C * (i + 1));
    C = mod(C * Fe(cnt, 1000000007 - 2));
    cnt++;
  }
  for (int i = 1; i <= n; i++) {
    long long ans = 0;
    for (int j = i; j >= 1; j--) ans = mod(ans + mod(arr[i - j + 1] * comb[j]));
    printf("%lld ", ans);
  }
  return 0;
}
