#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a %= 1000000007;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
long long int modInverse(long long int a) { return power(a, 1000000007 - 2); }
const int N = 500023;
bool vis[N];
vector<int> adj[N];
void solve() {
  long long int n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  s = '&' + s;
  map<long long int, long long int> repeat;
  for (long long int i = 0; i < m; i++) {
    long long int c;
    cin >> c;
    repeat[c]++;
  }
  long long int cnt[28] = {0};
  long long int final[28] = {0};
  for (int i = 1; i <= n; i++) {
    cnt[s[i] - 'a']++;
    final[s[i] - 'a']++;
    for (int j = 0; j < 26; j++) {
      final[j] += (cnt[j] * repeat[i]);
    }
  }
  for (int i = 0; i < 26; i++) {
    cout << final[i] << ' ';
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  cin >> T;
  int t = 0;
  while (t++ < T) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
