#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

const int maxn = ;

const int maxm = 1e6;

int num[maxm];

int map[] = { ,,,,,,,,,,,,,,,,,,,,,,,,, };

int a[] = {,,,,,};

int main()

{

    //freopen("E:\\acm\\input.txt","r",stdin);

    int T;

    cin>>T;

    while(T--){

        int N,M;

        scanf("%d %d",&N,&M);

        int Q[maxn];

        for(int i=;i<=N;i++)  scanf("%d",&Q[i]);

        memset(num,,sizeof(num));

        for(int i=;i<=M;i++){

            char s[];

            scanf("%s",s);

            int len = strlen(s);

            int sum = ,cnt =;

            for(int i=len-;i>=;i--){

                int temp = map[s[i]-'a'];

                sum += temp * a[cnt++];

            }

            num[sum]++;

        }

        for(int i=;i<=N;i++)

            printf("%d\n",num[Q[i]]);

    }

    return ;

}