#include<bits/stdc++.h>
using namespace std;
#define db(x){if(cond)cerr<<__LINE__<<" "<<#x<<" " <<x<<endl;}
#define rep(i,b)for(auto i=(0);i<(b);++i)
#define fo(i,a,b)for(auto i=(a);i<=(b);++i)
#define ford(i,a,b)for(auto i=(a);i>=(b);--i)
#define all(x) (x).begin(),(x).end()
#define vv vector
#define pb push_back
template<typename X>void MA(X&a,X b){a=max(a,b);}template<typename X>void MI(X&a,X b){a=min(a,b);}
template<typename X>void clr(X&x,int a){memset(x,a,sizeof(a));};typedef long long ll;typedef long double ld;
typedef array<int,2>i2;typedef vv<int>vi;int cond=0,multi=1,gcj=0;

string ANIMALS="EDCM";
const int MAXN=1<<16;

struct ST{
  int MAX[2*MAXN]={};
  int INC[2*MAXN]={};

  int get_max(){
    return MAX[1]+INC[1];
  }

  void add(int le, int ri, int val){
    int p1=MAXN+le,p2=MAXN+ri;

    INC[p1]+=val;
    if(p1!=p2)INC[p2]+=val;
    while(p1>=1&&p2>=1){
      if(p1/2!=p2/2) {
        if(p1<(p1^1)) INC[p1^1]+=val;
        if((p2^1)<p2) INC[p2^1]+=val;
      }
      if(p1<MAXN){
        MAX[p1]=max(MAX[2*p1]+INC[2*p1],MAX[2*p1+1]+INC[2*p1+1]);
      }
      if(p2<MAXN&&p1!=p2){
        MAX[p2]=max(MAX[2*p2]+INC[2*p2],MAX[2*p2+1]+INC[2*p2+1]);
      }
      p1/=2;p2/=2;
    }
  }
};


struct sol{
  int M=0,N=0;
  char T_RAW[MAXN+2]={};
  int T[MAXN+2]={},S[MAXN+2]={},D[MAXN+2]={};
  vi AN[MAXN+2][2];
  void init(){}

  ST st[2];
  void solve(){
    cin>>M>>N;
    db(M<<" "<<N);
    fo(i,1,N)cin>>T_RAW[i];
    fo(i,1,N)rep(j,4)if(T_RAW[i]==ANIMALS[j]){T[i]=j%2;break;}
    fo(i,1,N)cin>>S[i];
    fo(i,1,N)cin>>D[i];

    fo(i,1,N){ if(S[i]<D[i])AN[D[i]][T[i]].pb(S[i]); }
    fo(i,1,N)db(i<<" "<<T[i]<<" "<<S[i]<<" "<<D[i]);

    int max_so_far=0;
    vi ret(N+2,-1);
    int pointer=0;
    fo(i,1,M){
      rep(an,2)for(int sp:AN[i][an]){
        db(i<<" "<<an<<" "<<sp);
        st[an].add(0,sp,1);
      }
      int score[2]={st[0].get_max(),st[1].get_max()};
      rep(an,2){
        st[1-an].add(i,i,score[an]);
      }
      max_so_far=max(max_so_far,max(score[0],score[1]));
      assert(max_so_far<=N);
      while(pointer<=max_so_far)ret[pointer++]=i;
    }
    fo(i,1,N)cout<<ret[i]<<" ";cout<<"\n";
  }
};

int main(int argc,char** argv){
  ios::sync_with_stdio(false),cin.tie(0),cond=argc>=2&&argv[1][0]=='q'?1<<30:0;
  cout.setf(ios::fixed),cout.precision(10);int t;if(multi||gcj)cin>>t;else t=1;
  fo(i,1,t){if(cond)cerr<<__LINE__<<" "<<i<<endl;if(gcj)cout<<"Case #"<<i<<": ";
    sol*s=new sol();
    s->init();
    s->solve();
  }return 0;
}