#include <bits/stdc++.h>

using namespace std;
class node{
    public:
    int d,s;
    int g;
    node ()
    {}
    node(int d,int g,int s){
        this->d=d;
        this->s=s;
        this->g=g;

    }

    bool operator()(const node &n1,const node &n2)const
    {
    if(n2.d!=n1.d)
    return n1.d>n2.d;
    else if(n1.g!=n2.g)
      return n1.g>n2.g;
    else
        return n1.s>n2.s;

    }


};

vector <int> minimumZooNumbers(int m, int n, vector <char> t, vector <int> s, vector <int> d) {
    // Return a list of length n consisting of the answers
    priority_queue< node,vector<node>,node>pq;
    for(int i=0;i<n;i++)
    {
       int g=(t[i]=='D'||t[i]=='M')?0:1;
       node w(d[i],g,s[i]);
        pq.push(w);
    }
    node e=pq.top();
    pq.pop();
    int pd=e.d;
         int c1=0,c2=0;
    if(e.g==0)
        c1++;
    if(e.g==1)
        c2++;
    vector<int>v;
    node y;
    while(!pq.empty())
    {
        y=pq.top();
        
       if(y.d==pd){
            if(y.g==0)
            c1++;
            if(y.g==1)
            c2++;
            pq.pop();
       
       }
       else
       {
           for(int i=0;i<max(c1,c2);i++)
               v.push_back(pd);
           c1=0;
           c2=0;
           pd=y.d;
           
       }

    }
 
    if(v.empty())
        v.push_back(pd);
    for(int i=0;i<max(c1,c2);i++)
               v.push_back(pd);
    while(v.size()<n)
    v.push_back(-1);
    return v;

}

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;
}