#include <bits/stdc++.h>

using namespace std;

class Animal{
    public:
    char type;
    int source;
    int dest;
    public:
    Animal(char t, int s, int d){
        this->type = t;
        this->source = s;
        this->dest = d;
    }
    friend bool operator<(const Animal& a1 , const Animal& a2)
    {
        return (a1.source < a2.source)||(a1.source==a2.source && a1.dest < a2.dest);
    }
};

bool isCompatible(Animal a1, Animal a2){
    if(a1.dest > a2.source){
    if((a1.type == 'D' && a2.type == 'E')||(a1.type == 'E' && a2.type == 'D'))
        return false;
    else if((a1.type == 'D' && a2.type == 'C')||(a1.type == 'C' && a2.type == 'D'))
        return false;
    else if((a1.type == 'M' && a2.type == 'C')||(a1.type == 'C' && a2.type == 'M'))
        return false;
    else if((a1.type =='M' && a2.type == 'E')||(a1.type == 'E' && a2.type == 'M'))
        return false;
    }
    
    return true;  
}

vector <int> minimumZooNumbers(int m, int n, vector <char> t, vector <int> s, vector <int> d) {
    vector <Animal> animaux;
    for(int i=0;i<n;i++){
        animaux.push_back(Animal(t[i],s[i],d[i]));
    }
    sort(animaux.begin(), animaux.end());
    //for(int i=0;i<animaux.size();i++)
        //cout << animaux[i].type << " : " << animaux[i].source << " " << animaux[i].dest << endl;
        
    vector<int> ans(n);
    int a;
    ans[0] = animaux[0].dest;
    
    for(int i=1;i<n;i++){
       
        int count = 1;
        int nbAnimaux = i+1;
        int start = 0;
        int index;
        bool compatible;
        while(count<nbAnimaux && start < n){
            count = 1;
            vector<Animal> selected;
            selected.push_back(animaux[start]);
            index = start+1;
            while(index < n && count<nbAnimaux){
               compatible=true;
               for(auto a:selected){
                   compatible = compatible && isCompatible(a,animaux[index]);
               }
               if(compatible){
                   //cout << animaux[start].type << "&" << animaux[index].type << " OK" << endl;
                   ans[i] = animaux[index].dest;
                   count++;
                   selected.push_back(animaux[index]);
                   
               }
                  index++;
            }
            start++;
        }
        
        if(count < nbAnimaux)
            ans[i] = -1;
    }   
    
    return ans;
}

int main() {
    int cases;
    cin >> cases;
    for(int a0 = 0; a0 < cases; a0++){
        int m;
        int n;
        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(m, n, t, s, d);
        for (ssize_t i = 0; i < result.size(); i++) {
            cout << result[i] << (i != result.size() - 1 ? " " : "");
        }
        cout << endl;


    }
    return 0;
}