#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const long long mod = 1e9 + 7;
int a[N];
long long val[N];
long long ans[N];
void gcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
    return;
  }
  gcd(b, a % b, d, y, x);
  y -= x * (a / b);
}
long long inv(long long a, long long n) {
  long long d, x, y;
  gcd(a, n, d, x, y);
  return d == 1 ? (x + n) % n : -1;
}
int main() {
  int n, k;
  while (~scanf("%d%d", &n, &k)) {
    k++;
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    val[1] = 1;
    for (int i = 2; i <= n; i++)
      val[i] = val[i - 1] * (k + i - 3) % mod * inv(i - 1, mod) % mod;
    memset(ans, 0, sizeof(ans));
    int t = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = i; j <= n; j++) ans[j] = (ans[j] + a[i] * val[j - t]) % mod;
      t++;
    }
    for (int i = 1; i <= n - 1; i++) cout << ans[i] << " ";
    cout << ans[n] << endl;
  }
}
