#include <bits/stdc++.h>
#include <tr1/unordered_map>
typedef long long ll;
typedef unsigned long long ull;
#define clr(ma) memset(ma,-1,sizeof ma)
#define INF 1000000000
#define vi vector<int>
#define pi pair<int ,int >
#define mk make_pair
#define getBit(m,i) ((m&(1ll<<i))==(1ll<<i))
#define setBit(m,i) (m|(1<<i))
#define setBit2(m,i) (m|(1ull<<i))
#define cont(i,ma) ((ma.find(i))!=(ma.end()))
#define in(i) scanf("%d",&i)
#define in2(i,j) scanf("%d%d",&i,&j)
#define in3(i,j,k) scanf("%d%d%d",&i,&j,&k)
#define in4(i,j,k,l) scanf("%d%d%d%d",&i,&j,&k,&l)
#define itr map<int,int>::iterator
#define itr2 set<int>::iterator
#define id(k) scanf("%9lf",&k)
#define fi(ss) freopen (ss,"r",stdin)
#define fo(ss) freopen (ss,"w",stdout)
#define sc(s) scanf("%s",s)
#define clean(vis)  memset(vis,0,sizeof vis)
#define  bitcount(x)  (__builtin_popcount(x))
#define rep0(x) for(int i=0;i<x;i++)
#define rep1(x) for (int i=1;i<x;i++)
using namespace std;
const int N=50000+5;
void push (int i,vi & tree, vi & lazy){
    tree[i<<1]+=lazy[i];
    tree[i<<1|1]+=lazy[i];
    lazy[i<<1]+=lazy[i];
    lazy[i<<1|1]+=lazy[i];
    lazy[i]=0;
}
void upd (int i,int s,int e,int s1, int e1, vi & tree, vi & lazy,int v=-1){
 if (e<s1 || s> e1) return ;
    if (s>=s1 && e<=e1){
        if (v!=-1) {
            tree[i]=v;
            return;
        }
        tree[i]++;
        lazy[i]++;
        return ;
    }
    push(i,tree,lazy);
    int mid=(s+e)>>1;
    upd(i<<1,s,mid,s1,e1,tree,lazy,v);
    upd(i<<1|1,mid+1,e,s1,e1,tree,lazy,v);
    tree[i]=max(tree[i<<1],tree[i<<1|1]);
}
int  qur (int i,int s,int e,int s1, int e1, vi & tree, vi & lazy){
    if (e<s1 || s> e1) return 0;
    if (s>=s1 && e<=e1){
      return   tree[i];
    }
    push(i,tree,lazy);
    int mid=(s+e)>>1;
    return max(qur(i<<1,s,mid,s1,e1,tree,lazy), qur(i<<1|1,mid+1,e,s1,e1,tree,lazy));
}
int m,n;
vi ectree;
vi eclazy;
vi dmlazy;
vi dmtree;
vi EP [N];
vi DP [N];
vi CP [N];
vi MP [N];
char a [N];
int s [N];
int d [N];
char w [3];
int dp [N];

void init(){
    for (int i=0;i<=m;i++)EP[i].clear(),DP[i].clear(),CP[i].clear(),MP[i].clear();
    for (int i=0;i<n;i++){
        if (s[i]>d[i]) continue;
        if (a[i]=='E')EP[d[i]].push_back(s[i]);
        if (a[i]=='D')DP[d[i]].push_back(s[i]);
        if (a[i]=='C')CP[d[i]].push_back(s[i]);
        if (a[i]=='M')MP[d[i]].push_back(s[i]);
    }
    ectree.assign(5*m,0);
    eclazy.assign(5*m,0);
    dmtree.assign(5*m,0);
    dmlazy.assign(5*m,0);
}
int main(){
    int t;
    in(t);
    while (t--){
        in2(m,n);
        for (int i=0;i<n;i++){
            sc(w);
            a[i]=w[0];
        }
        for (int i=0;i<n;i++){
            in(s[i]);
        }
        for (int i=0;i<n;i++){
            in(d[i]);
        }
        init();
        dp[0]=dp[1]=0;
        for (int i=2;i<=m;i++){
            for (auto it : EP[i])upd(1,0,m,1,it,ectree,eclazy);
            for (auto it : CP[i])upd(1,0,m,1,it,ectree,eclazy);
            for (auto it : DP[i])upd(1,0,m,1,it,dmtree,dmlazy);
            for (auto it : MP[i])upd(1,0,m,1,it,dmtree,dmlazy);
            dp[i]=max(qur(1,0,m,1,i-1,ectree,eclazy),qur(1,0,m,1,i-1,dmtree,dmlazy));
           // cout<<dp[i]<<endl;
            upd(1,0,m,i,i,ectree,eclazy,dp[i]);
            upd(1,0,m,i,i,dmtree,dmlazy,dp[i]);
        }
        int p=0;
        for (int i=1;i<=n;i++){
            while (p<=m && dp[p]<i)p++;
            if (p>m)printf("%d ",-1);
            else printf("%d ",p);
        }
        puts("");
    }

}