#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) {
  long long g = gcd(a, b);
  long long ans = (a * b) / g;
  return ans;
}
long long add(long long a, long long b) {
  a += b;
  if (a >= 1000000007) a -= 1000000007;
  return a;
}
long long sub(long long a, long long b) {
  a -= b;
  if (a < 0) {
    a += 1000000007;
  }
  return a;
}
long long mul(long long a, long long b) { return (a * b) % 1000000007; }
vector<long long> primes;
bool prime[10005];
void seive() {
  memset(prime, 1, sizeof(prime));
  prime[0] = 0;
  prime[1] = 0;
  for (long long i = 2; i <= 10000; i++) {
    if (prime[i] == 1) {
      for (long long j = i * i; j <= 10000; j += i) prime[j] = 0;
    }
  }
}
long long power(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans % 1000000007 * a % 1000000007) % 1000000007;
    a = (a * a) % 1000000007;
    b = b / 2;
  }
  return ans;
}
template <typename T>
std::string NumberToString(T Number) {
  std::ostringstream ss;
  ss << Number;
  return ss.str();
}
long long gcdExtended(long long a, long long b, long long *x, long long *y);
long long modInverse(long long b, long long m) {
  long long x, y;
  long long g = gcdExtended(b, m, &x, &y);
  if (g != 1) return -1;
  return (x % m + m) % m;
}
long long modDivide(long long a, long long b, long long m) {
  a = a % m;
  long long inv = modInverse(b, m);
  return (inv * a) % m;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  long long p[m], i, j;
  map<long long, long long> mp_indices;
  for (i = 0; i < m; i++) {
    cin >> p[i];
    p[i]--;
    mp_indices[p[i]]++;
  }
  long long ans[26];
  for (i = 0; i < 26; i++) {
    ans[i] = 0;
  }
  long long next = 0;
  vector<pair<long long, long long> > indices;
  for (auto it : mp_indices) {
    indices.push_back({it.first, it.second});
  }
  map<char, long long> mp;
  for (i = 0; i < n; i++) {
    mp[s[i]]++;
    if (next < indices.size() and indices[next].first == i) {
      next++;
      for (auto it : mp) {
        char c = it.first;
        long long freq = it.second;
        ans[c - 'a'] += freq * indices[next - 1].second;
      }
    }
  }
  for (auto it : mp) {
    char c = it.first;
    long long freq = it.second;
    ans[c - 'a'] += freq;
  }
  for (i = 0; i < 26; i++) {
    cout << ans[i] << " ";
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  bool codechef = 1;
  long long t = 1;
  if (codechef) {
    cin >> t;
  }
  while (t--) {
    solve();
  }
  return 0;
}
