func_code_string: #include <bits/stdc++.h>   using namespace std;   const double pi = 3.1415926535897932384626433832795;   const int inf = 1e9;   const long long inf2 = 1e18;   const int mod = 1e9 + 7;   void boost() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);   }   inline long long exp(long long x, long long n, long long m = mod) {     long long r = 1;     while (n) {       if (n & 1) r = r * x % m;       x = x * x % m, n >>= 1;     }     return r;   }   void solve() {     int n, k;     cin >> n >> k;     vector<int> ncr(n + 1, 0);     vector<int> arr(n + 1);     for (int i = 1; i < n + 1; ++i) cin >> arr[i];     ncr[0] = 1;     for (int i = 1; i < n + 1; ++i) {       ncr[i] = (ncr[i - 1] * 1LL * (k + i - 1)) % mod;       ncr[i] = (ncr[i] * exp(i, mod - 2)) % mod;     }     vector<int> ans(n + 1, 0);     for (int i = 1; i < n + 1; ++i) {       for (int j = i; j < n + 1; ++j) {         ans[j] = (ans[j] * 1LL + 1LL * arr[i] * ncr[j - i]) % mod;       }     }     for (int i = 1; i < n + 1; ++i) cout << ans[i] <<    ;     return;   }   int main() {     boost();     int tc = 1;     while (tc--) solve();     return 0;   }   