Xiaoyang's Piggy Banks

Problem Description

Xiaoyang has $N$ piggy banks, numbered from $0$ to $N-1$. Starting from day $1$, Xiaoyang puts money into a piggy bank every day. Specifically, on day $i$ he chooses a piggy bank $a_i$ and deposits $i$ yuan. After $D$ days, he has forgotten how much money is in each piggy bank. Can you help him?

Input Format

The first line contains two integers $N$ and $D$, separated by a single space. The second line contains $D$ integers, where the $i$-th integer is $a_i$. Integers on each line are separated by a single space.

Output Format

Output $N$ integers separated by single spaces, where the $i$-th integer is the amount of money in the piggy bank numbered $i-1$ ($i = 1, \dots, N$).

Sample Input

Sample Input 1

2 3
0 1 0

Sample Input 2

3 5
0 0 0 2 0

Sample Output

Sample Output 1

4 2

Sample Output 2

11 0 4

Sample Explanation

On day $1$ Xiaoyang deposits $1$ yuan into bank $0$, on day $2$ deposits $2$ yuan into bank $1$, and on day $3$ deposits $3$ yuan into bank $0$. So bank $0$ has $1+3=4$ yuan and bank $1$ has $2$ yuan, matching the output 4 2.

Constraints

• $1 \le N, D \le 1000$
• $0 \le a_i \le N-1$
• All inputs are integers