#include <iostream>
#include <algorithm>
#define MAXN 1123
 
using namespace std;
 
int main() {
	int N, K;
	int S[MAXN];
	long long int sum = 0, ans[MAXN];
 
	cin >> N >> K;
	for(int i=0; i<N; i++)
		cin >> S[i], sum += S[i];
 
	fill(ans, ans+N, sum*(K/N) );
 
	for(int i=0; i<K%N; i++) {
		for(int j=0; j<N; j++) {
			int index_s = j-i < 0 ? N + (j-i) : j-i;
 
			ans[j] += S[ index_s ];
		}
	}
 
	cout << ans[0];
	for(int i=1; i<N; i++)
		cout << ' ' << ans[i];
	cout << endl;
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojZGVmaW5lIE1BWE4gMTEyMwoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IE4sIEs7CglpbnQgU1tNQVhOXTsKCWxvbmcgbG9uZyBpbnQgc3VtID0gMCwgYW5zW01BWE5dOwoKCWNpbiA+PiBOID4+IEs7Cglmb3IoaW50IGk9MDsgaTxOOyBpKyspCgkJY2luID4+IFNbaV0sIHN1bSArPSBTW2ldOwoKCWZpbGwoYW5zLCBhbnMrTiwgc3VtKihLL04pICk7CgkKCWZvcihpbnQgaT0wOyBpPEslTjsgaSsrKSB7CgkJZm9yKGludCBqPTA7IGo8TjsgaisrKSB7CgkJCWludCBpbmRleF9zID0gai1pIDwgMCA/IE4gKyAoai1pKSA6IGotaTsKCQkJCgkJCWFuc1tqXSArPSBTWyBpbmRleF9zIF07CgkJfQoJfQoKCWNvdXQgPDwgYW5zWzBdOwoJZm9yKGludCBpPTE7IGk8TjsgaSsrKQoJCWNvdXQgPDwgJyAnIDw8IGFuc1tpXTsKCWNvdXQgPDwgZW5kbDsKCQoJcmV0dXJuIDA7Cn0=

CjMgOAoKNiAzIDc=

3 8

6 3 7