You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's determine a two step operation like that:

  1. First we build by the array a an array s of partial sums, consisting of n elements. Element number i (1 ≤ i ≤ n) of array s equals <image>. The operation x mod y means that we take the remainder of the division of number x by number y. 
  2. Then we write the contents of the array s to the array a. Element number i (1 ≤ i ≤ n) of the array s becomes the i-th element of the array a (ai = si). 



You task is to find array a after exactly k described operations are applied.

Input

The first line contains two space-separated integers n and k (1 ≤ n ≤ 2000, 0 ≤ k ≤ 109). The next line contains n space-separated integers a1, a2, ..., an — elements of the array a (0 ≤ ai ≤ 109).

Output

Print n integers — elements of the array a after the operations are applied to it. Print the elements in the order of increasing of their indexes in the array a. Separate the printed numbers by spaces.

Examples

Input

3 1
1 2 3


Output

1 3 6


Input

5 0
3 14 15 92 6


Output

3 14 15 92 6
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long somme(long long a, long long b) { return (a + b) % MOD; }
long long produit(long long a, long long b) { return (a * b) % MOD; }
long long powmod(long long x, long long n) {
  long long res = 1, y;
  if (n == 0) return 1;
  if (n == 1) return x;
  if (n & 1) res = x % MOD;
  y = powmod(x, n / 2);
  return produit(res, produit(y, y));
}
int main() {
  long long inv[2010];
  int i, j;
  long long n, k, a[2010], b[2010], comb;
  cin >> n >> k;
  for (i = 1; i < 2010; i++) inv[i] = powmod(i, MOD - 2);
  for (i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = 0;
  }
  if (!k) {
    for (i = 0; i < n; i++) {
      if (i) cout << " ";
      cout << a[i];
    }
    cout << endl;
    return 0;
  }
  k--;
  comb = 1;
  for (i = 0; i < n; i++) {
    for (j = i; j < n; j++) {
      b[j] = somme(b[j], produit(comb, a[i]));
    }
    comb = produit(inv[i + 1], produit(comb, k + i + 1));
  }
  for (i = 0; i < n; i++) {
    if (i) cout << " ";
    cout << b[i];
  }
  cout << endl;
  return 0;
}
