Score : 1400 points
Snuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i. Snuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:
After these Q operations, find how many times each of the integers 1 through N appears in the final sequence.
The input is given from Standard Input in the following format:
N Q q_1 : q_Q
Print N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.
5 3 6 4 11
3 3 3 2 0
After the first operation, the sequence becomes: 1,2,3,4,5,1.
After the second operation, the sequence becomes: 1,2,3,4.
After the third operation, the sequence becomes: 1,2,3,4,1,2,3,4,1,2,3.
In this sequence, integers 1,2,3,4,5 appear 3,3,3,2,0 times, respectively.
10 10 9 13 18 8 10 10 9 19 22 27
7 4 4 3 3 2 2 2 0 0