A string is a finite sequence of symbols that are chosen from an alphabet. In this problem you are given a string T and n queries each with a string P_i, where the strings contain lower case English alphabets only. You have to find the number of times P_i occurs as a substring of T.

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 500). The next line contains the string T (1 ≤ |T| ≤ 10⁶). Each of the next n lines contains a string P_i (1 ≤ |P_i| ≤ 500).

For each case, print the case number in a single line first. Then for each string P_i, report the number of times it occurs as a substring of T in a single line.

• Dataset is huge, use faster I/O methods.
• If S is a string then |S| denotes the length of S.