Statement

Consider inputting $n$ strings $s$ consisting of lowercase letters, where $1\leq n\leq 1\times 10^3$ and $1<s.\text{size()}\leq 1\times 10^3$. Output the number of occurrences of each lowercase letter from a to z.

Input

The first line gives an integer $n$.

Next, there are $n$ lines, with each line containing a number $a$ and a string $s$, where $a$ represents the length of $s$.

Output

For each string, output a line containing 26 integers representing the occurrence frequencies of characters from a to z.

Samples

3
9 adsuidazz
2 ab
10 dschhymklz

2 0 0 2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 2
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 2 0 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 1 1