Christmas Party

JOI went to a Christmas party with $N$ friends, numbered friend 1 through friend $N$. Once the party warmed up, JOI decided to play the following game with them.

1. JOI picks one of the $N$ friends. Call that friend the target.
2. JOI secretly tells only the chosen friend that they are the target. The other friends do not know who the target is.
3. Each friend who is not the target writes on a slip of paper the name of the person they think is the target. The target writes their own name.
4. Once everyone has written a name, JOI announces the target's name.
5. A friend who wrote the target's name earns 1 point. The target wrote their own name, so the target always earns 1 point. A friend who wrote any other name earns nothing.
6. If $X$ friends failed to write the target's name, the target earns $X$ additional points.

JOI and the friends played this game $M$ times. Compute each friend's total score after all $M$ games.

The input has $3 + M$ lines.

The first line contains the number of friends $N$ ($3 \le N \le 100$).

The second line contains the number of games $M$ ($3 \le M \le 100$).

The third line contains $M$ integers $A_1, A_2, \dots, A_M$ separated by spaces. $A_i$ ($1 \le A_i \le N$) means that the target of game $i$ is friend $A_i$.

The $i$-th of the following $M$ lines contains $N$ integers $B_{i,1}, B_{i,2}, \dots, B_{i,N}$ separated by spaces. $B_{i,j}$ ($1 \le B_{i,j} \le N$) means that in game $i$, friend $j$ wrote the name of friend $B_{i,j}$. The target writes their own name, so whenever $j = A_i$ it holds that $B_{i,j} = j$.

Print $N$ lines. Line $j$ contains the total score friend $j$ earned over the $M$ games.