#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked

#define ll long long
#define ull unsigned long long
#define ld long double

typedef pair<int, int>	pi;
typedef pair<ll, ll>	pll;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pi>		vpi;
typedef vector<pll>		vpll;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;

#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define sub(a,b) a-b
#define orr(a,b) a||b
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define slen(s) strlen(s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define boostIO ios_base::sync_with_stdio(false), cin.tie(0)
#define tc(t) ll t; cin >> t; while(t--)
#define PI 3.1415926535897932384626
#define beg int main()
#define ret return 0
#define bye exit(0)
#define nxl <<endl
#define show cout<<
#define INF 0x3f3f3f3f
#define MAX 200000
#define mod 1000000007

ll power2(ll a, ll b) { if(b == 0) return 1; if(b == 1) return a; ll x = power2(a, b / 2); x = x * x; if(b % 2) x = x * a; return x;}
ll gcd(ll a, ll b) {if(a < b) swap(a, b); while(b) {ll t = b; b = a % b; a = t;} return a;}
ll mul(ll a, ll b, ll m = mod) { return (ll)(a * b) % m;}
ll add(ll a, ll b, ll m = mod) { a += b; if(a >= m) a -= m; if(a < 0) a += m; return a;}
ll power(ll a, ll b, ll m = mod) { if(b == 0) return 1; if(b == 1) return (a % m); ll x = power(a, b / 2, m); x = mul(x, x, m); if(b % 2) x = mul(x, a, m); return x;}


// ll bin_ser(ll low,ll high,ll key){

//    while(low<=high){
//        ll mid = (low+high)/2;
//        if(v1[mid]<key){
//            low = mid+1;
//        }
//        else if(v1[mid]>key){
//            high = mid-1;
//        }
//        else{
//            return (mid+1);
//        }
//    }
//    return -1;
// }

bool yoyo(const ll p1 ,const ll p2){
    return p1 > p2;
}

beg{

    ll i,j,k,l,t,a,r,n,m,b,c;
    cin >> t;
    while(t--){
        cin >> m >> n;
        char tval[n+2];
        ll ee[m+2];
        ll es[m+2];
        ll de[m+2];
        ll ds[m+2];
        ll ce[m+2];
        ll cs[m+2];
        ll me[m+2];
        ll ms[m+2];
        ll sval[n+2];
        ll dval[n+2];
        clr(es);
        clr(ee);
        clr(ms);
        clr(me);
        clr(cs);
        clr(ce);
        clr(ds);
        clr(de);
        priority_queue<pair<ll,pll>,vector<pair<ll,pll> >,greater<pair<ll,pll> > > qe,qd;
        for(i=0;i<n;i++){
            cin >> tval[i];
        }
        for(i=0;i<n;i++){
            cin >> sval[i];
        }
        for(i=0;i<n;i++){
            cin >> dval[i];
            if(tval[i]=='E' || tval[i]=='C'){
                qe.push({dval[i],{sval[i],dval[i]}});
                if(tval[i]=='E'){
                    ee[dval[i]]++;
                    es[sval[i]]++;
                }
                if(tval[i]=='C'){
                    ce[dval[i]]++;
                    cs[sval[i]]++;
                }
            }
            else if(tval[i]=='D' || tval[i]=='M'){
                qd.push({dval[i],{sval[i],dval[i]}});
                if(tval[i]=='D'){
                    de[dval[i]]++;
                    ds[sval[i]]++;
                }
                if(tval[i]=='M'){
                    me[dval[i]]++;
                    ms[sval[i]]++;
                }
            }
        }
        ll dpes[m+2];
        ll dpee[m+2];
        ll dpcs[m+2];
        ll dpce[m+2];
        ll dpms[m+2];
        ll dpme[m+2];
        ll dpds[m+2];
        ll dpde[m+2];

        ll inter[m+2];
        ll fin[m+2];
        ll nval[n+2];

        clr(dpes);
        clr(dpee);
        clr(dpcs);
        clr(dpce);
        clr(dpms);
        clr(dpme);
        clr(dpds);
        clr(dpde);
        clr(fin);
        clr(inter);
        clr(nval);
        ll penes=0,pends=0;
        ll curee=0,curde=0;
        ll penms=0,pencs=0;
        ll curme=0,curce=0;

        ll err=0;
        for(i=1;i<=m;i++){
            dpes[i] = dpes[i-1] + es[i];
            dpee[i] = dpee[i-1] + ee[i];
            dpms[i] = dpms[i-1] + ms[i];
            dpme[i] = dpme[i-1] + me[i];
            dpcs[i] = dpcs[i-1] + cs[i];
            dpce[i] = dpce[i-1] + ce[i];
            dpds[i] = dpds[i-1] + ds[i];
            dpde[i] = dpde[i-1] + de[i];

            err=0;
                if(pends==0 && penms==0){
                    penes += es[i];
                    pencs += cs[i];
                    curee += ee[i];
                    curce += ce[i];
                    penes -= ee[i];
                    pencs -= ce[i];
                }

                if(penes==0 && pencs==0){
                    pends += ds[i];
                    penms += ms[i];
                    curde += de[i];
                    curme += me[i];
                    pends += de[i];
                    penms += me[i];
                }


            fin[i] = max(dpee[i]+dpce[i],dpde[i]+dpme[i]);

            if(penes==0 && pencs==0 && curee==0 && curce==0){
                inter[i] = max(inter[i],dpee[i] + dpce[i] + curde + curme);
            }
            if(pends==0 && penms==0 && curde==0 && curme==0){
                inter[i] = max(inter[i],dpde[i] + dpme[i] + curee + curce);
            }
            //inter[i] += inter[i-1];
            fin[i] = max(fin[i],inter[i]);

            if(!nval[fin[i]]) nval[fin[i]] = i;
            else nval[fin[i]] = min(nval[fin[i]],i);

            curee=0;
            curde=0;
            curme=0;
            curce=0;
        }


        stack<ll> st;
        ll prev=-1;
        for(i=n;i>=1;i--){
            if(nval[i]==0){
                st.push(prev);
            }
            else{
                if(prev==-1){
                    prev = nval[i];
                }
                else{
                    prev = min(prev,nval[i]);
                }
                st.push(prev);
//                prev = min(prev,nval[i]);
            }
        }
        while(st.size()){
            cout<<st.top()<<" ";
            st.pop();
        }
        cout<<endl;

    }

ret;
}