#include<bits/stdc++.h>
using namespace std;
int n,m;
int minI[1000000];
#define inf 100000007
vector<char>type;
vector<int>S;
vector<int>D;
unordered_map<int,vector<int>>station;
int min(int a,int b){
    return a<b?a:b;
}
void cal(int s,int count,unordered_map<char,int>types,unordered_set<int>who,int z){
    if(s==m+1)return ;
    vector<int>deleted;
    for(auto i=who.begin();i!=who.end();i++){
        if(D[*i]==s){
            count++;
            deleted.push_back(*i);
        }}
    for(int i=0;i<deleted.size();i++){
        types[type[deleted[i]]]--;
        who.erase(deleted[i]);}
    minI[count]=min(minI[count],s);
    for(int i=z;i<station[s].size();i++){
            if(type[station[s][i]]=='D'){
                if(types['E']==0&&types['C']==0){
                    types['D']++;
                    who.insert(station[s][i]);
                    cal(s,count,types,who,z+1);
                    types['D']--;
                    who.erase(station[s][i]);
                    cal(s,count,types,who,z+1);
                }
             
            }
        
            if(type[station[s][i]]=='C'){
                if(types['D']==0&&types['M']==0){
                    types['C']++;
                    who.insert(station[s][i]);
                    cal(s,count,types,who,z+1);
                    types['C']--;
                    who.erase(station[s][i]);
                    cal(s,count,types,who,z+1);
                    
                }
                
            }
             if(type[station[s][i]]=='M'){
                if(types['C']==0&&types['E']==0){
                    types['M']++;
                    who.insert(station[s][i]);
                    cal(s,count,types,who,z+1);
            
                    types['M']--;
                    who.erase(station[s][i]);
                    cal(s,count,types,who,z+1);
                 
                }
                
            }
             if(type[station[s][i]]=='E'){
                if(types['M']==0&&types['D']==0){
                    types['E']++;
                    who.insert(station[s][i]);
                    cal(s,count,types,who,z+1);
                 
                    types['E']--;
                    who.erase(station[s][i]);
                    cal(s,count,types,who,z+1);
                  
                }
               
          
    
    }}
    cal(s+1,count,types,who,0);
  

}
int main(){
    int t;
    cin>>t;
    while(t--){
        cin>>m>>n;
        type.clear();
        S.clear();
        D.clear();
        station.clear();
        for(int i=0;i<n;i++){char c;cin>>c;type.push_back(c);}
        for(int i=0;i<n;i++){int x;cin>>x;S.push_back(x);}
        for(int i=0;i<n;i++){int x;cin>>x;D.push_back(x);}
        for(int i=0;i<n;i++){station[S[i]].push_back(i);}
        unordered_map<char,int>types;
        unordered_set<int>p;
        fill(minI,minI+n+2,inf);
        cal(1,0,types,p,0);
        for(int i=1;i<=n;i++){
            if(minI[i]==inf)cout<<"-1 ";
           else{ cout<<minI[i]<<' ';}
        }cout<<'\n';  
    }
    return 0;
}