CF223C Partial Sums

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

The first line contains two space-separated integers $ n $ and $ k $ ( $ 1

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.