#include "bits/stdc++.h"
using namespace std;
const int N = 5e4+5;
int t, n, m;
int src[N], dst[N];
char tp[N];
int tp1[N], tp2[N], ans[N];
int tree[2][4*N], laz[2][4*N];
int out[N];
vector< pair<int,int> > cry[N];
int get(char c){
    if(c == 'E' || c == 'C')return 0;
    return 1;
}
void push(int node, int s, int e){
    tree[0][node] += laz[0][node];
    tree[1][node] += laz[1][node];
    if(s!=e){
      laz[0][node<<1] += laz[0][node];
      laz[0][node<<1|1] += laz[0][node];
      laz[1][node<<1] += laz[1][node];
      laz[1][node<<1|1] += laz[1][node];
    }
    laz[0][node] = laz[1][node] = 0;
}
void upd(int node, int s, int e, int l, int r, int tp){
     push(node,s,e);
     if(r<s||e<l)return;
     if(l<=s&&e<=r){
         if(tp == -1){
            laz[0][node]++;
            push(node,s,e);
         }
         else if(tp == -2){
            laz[1][node]++;
            push(node,s,e);
         }
         else{
            ans[s] = tp;
            tree[0][node] += ans[s];
            tree[1][node] += ans[s];
          }
         return;
     }
    int md = (s+e)>>1;
    upd(node << 1, s, md, l, r, tp);
    upd(node << 1 | 1, md + 1, e, l, r, tp);
    tree[0][node] = max(tree[0][node<<1], tree[0][node<<1|1]);
    tree[1][node] = max(tree[1][node<<1], tree[1][node<<1|1]);
}
int main(){

  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> t;
  while(t--){

    cin >> n >> m;

    for(int i = 0; i < m; i++)cin >> tp[i];
    for(int i = 0; i < m; i++)cin >> src[i];
    for(int i = 0; i < m; i++)cin >> dst[i];
    for(int i = 0; i < m; i++)if(src[i]<dst[i])
        cry[dst[i]].push_back(make_pair(src[i],get(tp[i])));
    memset(tree, 0, sizeof tree);
    memset(laz, 0, sizeof tree);
    memset(ans, 0, sizeof ans);
    memset(out, -1, sizeof out);
    for(int i = 1; i <= n; i++){
        for(auto v : cry[i])if(v.second == 0)
            upd(1,0,n, 0,v.first,-1);
            else if(v.second == 1)
            upd(1,0,n, 0,v.first,-2);
        upd(1,0,n,i,i, max(tree[0][1], tree[1][1]));
        cry[i].clear();
    }
    //cout << ans[5] << '\n';
    int cur = 0;
    for(int i = 1; i <= n; i++){
      while(ans[i]>=cur)
        out[cur++] = i;
    }
    for(int i = 1; i <= m; i++)
      cout << out[i] << " \n"[i==m];


  }

  return 0;
}