#include <bits/stdc++.h>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
long long int a[200005], b[200005], c[200005];
long long int bigmod(long long int n, long long int p) {
  if (p == 0) return 1;
  long long int x = bigmod(n, p / 2);
  x = (x * x) % 1000000007;
  if (p % 2 == 1) x = (x * n) % 1000000007;
  return x;
}
int main() {
  long long int n, i, j, k;
  while (cin >> n >> k) {
    for (long long int i = 1; i < n + 1; i++) {
      cin >> a[i];
      b[i] = a[i];
    }
    c[0] = 1;
    for (i = 1; i <= n; i++) {
      c[i] = c[i - 1] * (k + i - 1);
      c[i] %= 1000000007;
      c[i] = c[i] * bigmod(i, 1000000007 - 2);
      c[i] %= 1000000007;
    }
    for (i = 1; i <= n; i++) {
      for (j = i + 1; j <= n; j++) {
        b[j] = b[j] + (a[i] * c[j - i]) % 1000000007;
        b[j] %= 1000000007;
      }
    }
    for (i = 1; i <= n; i++) cout << b[i] << " ";
    cout << endl;
  }
  return 0;
}
