Problem: You want to perform the combo on your opponent in one popular fighting game. The combo is the string s consisting of n lowercase Latin letters. To perform the combo, you have to press all buttons in the order they appear in s. I.e. if s="abca" then you have to press 'a', then 'b', 'c' and 'a' again.

You know that you will spend m wrong tries to perform the combo and during the i-th try you will make a mistake right after p_i-th button (1 ≤ p_i < n) (i.e. you will press first p_i buttons right and start performing the combo from the beginning). It is guaranteed that during the m+1-th try you press all buttons right and finally perform the combo.

I.e. if s="abca", m=2 and p = [1, 3] then the sequence of pressed buttons will be 'a' (here you're making a mistake and start performing the combo from the beginning), 'a', 'b', 'c', (here you're making a mistake and start performing the combo from the beginning), 'a' (note that at this point you will not perform the combo because of the mistake), 'b', 'c', 'a'.

Your task is to calculate for each button (letter) the number of times you'll press it.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases.

Then t test cases follow.

The first line of each test case contains two integers n and m (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m ≤ 2 ⋅ 10^5) — the length of s and the number of tries correspondingly.

The second line of each test case contains the string s consisting of n lowercase Latin letters.

The third line of each test case contains m integers p_1, p_2, ..., p_m (1 ≤ p_i < n) — the number of characters pressed right during the i-th try.

It is guaranteed that the sum of n and the sum of m both does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5, ∑ m ≤ 2 ⋅ 10^5).

It is guaranteed that the answer for each letter does not exceed 2 ⋅ 10^9.

Output

For each test case, print the answer — 26 integers: the number of times you press the button 'a', the number of times you press the button 'b', ..., the number of times you press the button 'z'.

Example

Input


3
4 2
abca
1 3
10 5
codeforces
2 8 3 2 9
26 10
qwertyuioplkjhgfdsazxcvbnm
20 10 1 2 3 5 10 5 9 4


Output


4 2 2 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 9 4 5 3 0 0 0 0 0 0 0 0 9 0 0 3 1 0 0 0 0 0 0 0 
2 1 1 2 9 2 2 2 5 2 2 2 1 1 5 4 11 8 2 7 5 1 10 1 5 2 

Note

The first test case is described in the problem statement. Wrong tries are "a", "abc" and the final try is "abca". The number of times you press 'a' is 4, 'b' is 2 and 'c' is 2.

In the second test case, there are five wrong tries: "co", "codeforc", "cod", "co", "codeforce" and the final try is "codeforces". The number of times you press 'c' is 9, 'd' is 4, 'e' is 5, 'f' is 3, 'o' is 9, 'r' is 3 and 's' is 1.

Solution (in PYTHON3):

Solution:
import sys
from collections import defaultdict
from itertools import permutations, combinations
import string
from heapq import heapify, heappush, heappop
def solve():
    alphabets = string.ascii_lowercase 
    digits = string.digits
    get_arr = lambda type_=int: list(map(type_, sys.stdin.readline().rstrip('\n').split()))
    inp = lambda type_=int: type_(sys.stdin.readline().rstrip('\n'))
    pair = lambda type_=int: map(type_, sys.stdin.readline().rstrip('\n').split(' '))
    t = inp()
    for _ in range(t):
        n, m = pair()
        string_ = inp(str)
        arr = get_arr()
        d = defaultdict(int)
        arr = sorted(arr)
        prev = 0
        for i in range(m):
            num = arr[i]
            for j in range(prev, num):
                char = string_[j]
                d[char] += (m-i)
            prev = num
        for i in range(n):
            d[string_[i]] += 1
        for alpha in alphabets:
            print(d[alpha], end = ' ')
        print()
solve()




#================================================================================================================ 
# class TreeNode:
    #     def __init__(self, val, start, end):
    #         self.val = val
    #         self.left = None
    #         self.right = None
    #         self.range = (start, end)
    #     def __str__(self):
    #         return self.val

    # class SegTree:
    #     def __init__(self, arr):
    #         self.arr = arr
    #         self.root = self.create_tree(0, len(arr)-1)
    #     def create_tree(self, l, r):
    #         m = (l+r)//2
    #         if l == r:
    #             node = TreeNode(self.arr[l], l, r)
    #             return node
    #         node = TreeNode(0, l, r)
    #         node.left = self.create_tree(l, m)
    #         node.right = self.create_tree(m+1, r)
    #         node.val = node.left.val + node.right.val
    #         return node
    #     def execute_query(self, l, r, node):
    #         a, b = node.range
    #         if l == a and r == b:
    #             return node.val
    #         mid = (a+b)//2
    #         if r <= mid:
    #             return self.execute_query(l, r, node.left)
    #         elif l >= mid+1:
    #             return self.execute_query(l, r, node.right)
    #         else:
    #             return self.execute_query(l, mid, node.left) + self.execute_query(mid+1, r, node.right) 
    #     def update(self, idx, new_val, node):
    #         l, r = node.range
    #         if l == idx and r == idx:
    #             res = new_val - node.val
    #             node.val = new_val
    #             return res
    #         m = (l+r)//2
    #         if idx <= m:
    #             res = self.update(idx, new_val, node.left)
    #         else:
    #             res = self.update(idx, new_val, node.right)
    #         node.val += res
    #         return res
#================================================================================================================