#include <bits/stdc++.h>

using namespace std;

/*
 int dm_cnt, dm_last;
 int ce_cnt, ce_last;
 */

const int MAXN = 6e4;
const int INF = 1e9;
struct zoo {
  vector<int> dest_dm;
  vector<int> dest_ce;
} z[MAXN];
int m, n;
int comu_dm_s[MAXN];
int comu_dm_d[MAXN];
int comu_ce_s[MAXN];
int comu_ce_d[MAXN];

int memo[10005][10005];
int solve(int index, int rem) {
  if (rem <= 0) {
    return index;
  }
  if (index > m) {
    return INF;
  }
  int & ret = memo[index][rem];
  if (ret != -1)
    return ret;
  ret = solve(index + 1, rem);
  for (int i = 0; i < (int) z[index].dest_dm.size(); i++) {
    int nxt = z[index].dest_dm[i];
    ret = min(ret,
        solve(nxt, rem - (comu_dm_d[nxt] - (index == 0 ? 0 : comu_dm_s[index - 1]))));
  }
  for (int i = 0; i < (int) z[index].dest_ce.size(); i++) {
    int nxt = z[index].dest_ce[i];
    ret = min(ret,
        solve(nxt, rem - (comu_ce_d[nxt] - (index == 0 ? 0 : comu_ce_s[index - 1]))));
  }
  return ret;
}

vector<int> minimumZooNumbers(vector<char> t, vector<int> s, vector<int> d) {
  memset(memo, -1, sizeof memo);
  memset(comu_dm_s, 0, sizeof comu_dm_s);
  memset(comu_dm_d, 0, sizeof comu_dm_d);
  memset(comu_ce_s, 0, sizeof comu_ce_s);
  memset(comu_ce_d, 0, sizeof comu_ce_d);
  for (int i = 0; i < m; i++) {
    z[i].dest_dm.clear();
    z[i].dest_ce.clear();
  }
  for (int i = 0; i < (int) t.size(); i++) {
    if (s[i] > d[i]) {
      continue;
    }
    if (t[i] == 'D' || t[i] == 'M') {
      z[s[i]].dest_dm.push_back(d[i]);
      comu_dm_s[s[i]]++;
      comu_dm_d[d[i]]++;
    } else {
      comu_ce_s[s[i]]++;
      comu_ce_d[d[i]]++;
      z[s[i]].dest_ce.push_back(d[i]);
    }
  }
  for (int i = 0; i <= m; i++) {
    sort(z[i].dest_dm.begin(), z[i].dest_dm.end());
    sort(z[i].dest_ce.begin(), z[i].dest_ce.end());
//    cout<<i<<": dm="<<z[i].dest_dm.size() <<",  ce="<<z[i].dest_ce.size() <<endl;
    if (i) {
      comu_dm_s[i] += comu_dm_s[i - 1];
      comu_dm_d[i] += comu_dm_d[i - 1];
      comu_ce_s[i] += comu_ce_s[i - 1];
      comu_ce_d[i] += comu_ce_d[i - 1];
    }
  }
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    int res = solve(1, i);
    if(res == INF) res = -1;
    ans.push_back(res);
  }
  return ans;
}

int main() {
  int cases;
  cin >> cases;
  for (int a0 = 0; a0 < cases; a0++) {
    cin >> m >> n;
    vector<char> t(n);
    for (int t_i = 0; t_i < n; t_i++) {
      cin >> t[t_i];
    }
    vector<int> s(n);
    for (int s_i = 0; s_i < n; s_i++) {
      cin >> s[s_i];
    }
    vector<int> d(n);
    for (int d_i = 0; d_i < n; d_i++) {
      cin >> d[d_i];
    }
    vector<int> result = minimumZooNumbers(t, s, d);
    for (ssize_t i = 0; i < (int) result.size(); i++) {
      cout << result[i] << (i != (int) result.size() - 1 ? " " : "");
    }
    cout << endl;
  }
  return 0;
}