#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;

struct S{
    set<int> EDCM[4];
    int cnt;
};

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
    map<char, int> dict;
    dict['E'] = 0;
    dict['D'] = 1;
    dict['C'] = 2;
    dict['M'] = 3;

    for(int i=0; i<n; i++){
        s[i]--;
        d[i]--;
    }

    vector<vector<int>> ss(m), dd(m);
    for(int i=0; i<n; i++){
        ss[s[i]].push_back(i);
        dd[d[i]].push_back(i);
    }

    vector<S> vec;
    S s0;
    s0.cnt = 0;
    vec.push_back(s0);
    vector<int> ans(m, 0);
    for(int i=0; i<m; i++){
        for(int j=0; j<dd[i].size(); j++){
            int id = dd[i][j];
            int anim = dict[t[id]];
            int star = s[id];
            int dest = i;
            for(auto &state : vec){
                auto itr = state.EDCM[anim].find(star);
                if(itr != state.EDCM[anim].end()){
                    state.cnt++;
                    state.EDCM[anim].erase(itr);
                }
            }
        }
        for(auto &state : vec){
            ans[i] = max(ans[i], state.cnt);
        }

        for(int j=0; j<ss[i].size(); j++){
            int id = ss[i][j];
            int anim = dict[t[id]];
            int star = i;
            int dest = d[id];
            vector<S> v2;
            for(auto &state : vec){
                if(state.EDCM[(anim+1)%4].size() == 0 &&
                    state.EDCM[(anim-1+4)%4].size() == 0){
                    S s2 = state;
                    s2.EDCM[anim].insert(star);
                    v2.push_back(s2);
                }
            }
            for(auto &state : v2)
                vec.push_back(state);
        }
    }
    //for(int i=0; i<m; i++)
    //    cerr << ans[i] << " ";
    //cerr << endl;

    vector<int> ret(n);
    int pos = 0;
    for(int i=0; i<m; i++){
        if(ans[i] > pos){
            for(int j=pos; j<ans[i]; j++){
                ret[j] = i + 1;
            }
            pos = ans[i];
        }
    }
    for(int j=pos; j<n; j++) ret[j] = -1;
    return ret;
}

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