#include <bits/stdc++.h>
#define LIM 60000
using namespace std;
int segtree[2][4*LIM],lazy[2][4*LIM];
void push(int ind,int node,int s,int e)
{
    if(lazy[ind][node])
    {
        segtree[ind][node]+=lazy[ind][node];
        if(s!=e)
        {
            lazy[ind][2*node]+=lazy[ind][node];
            lazy[ind][2*node+1]+=lazy[ind][node];
        }
        lazy[ind][node]=0;
    }
}
void update1(int ind,int node,int st,int en,int a,int b)
{
    push(ind,node,st,en);
    if(b<st||a>en||b<a)
            return ;
    if(a<=st&&b>=en)
    {
        lazy[ind][node]=1;
        push(ind,node,st,en);
        return ;
    }
    int mid=(st+en)/2;
    update1(ind,node*2,st,mid,a,b);
    update1(ind,node*2+1,mid+1,en,a,b);
    segtree[ind][node]=max(segtree[ind][2*node],segtree[ind][2*node+1]);
}
void update2(int ind,int node,int st,int en,int in,int val)
{
    push(ind,node,st,en);
    if(in<st||in>en)
            return ;
    if(st==en)
    {
        segtree[ind][node]=val;
        return ;
    }
    int mid=(st+en)/2;
    update2(ind,node*2,st,mid,in,val);
    update2(ind,node*2+1,mid+1,en,in,val);
    segtree[ind][node]=max(segtree[ind][2*node],segtree[ind][2*node+1]);
}
int query(int ind,int node,int st,int en,int a,int b)
{
    push(ind,node,st,en);
    if(b<st||a>en||b<a)
            return 0;
    if(a<=st&&b>=en)
        return segtree[ind][node];
    int mid=(st+en)/2;
    return max(query(ind,2*node,st,mid,a,b),query(ind,2*node+1,mid+1,en,a,b));
}
vector <int> minimumZooNumbers(int n, int m, vector <char> t, vector <int> s, vector <int> d) {
    int i,dp[LIM]={0},j;
    vector<int>ans(m);
    vector<int>v1[LIM],v2[LIM];
    for(i=0;i<m;i++)
			ans[i]=INT_MAX;
	for(i=0;i<m;i++)
	{
        if(s[i]>d[i])
            continue;
        if(t[i]=='E'||t[i]=='C')
            v1[d[i]].push_back(s[i]);
        else
            v2[d[i]].push_back(s[i]);
    }     
    for(i=1;i<=n;i++)
    {
        dp[i]=dp[i-1];
        for(j=0;j<v1[i].size();j++)
        {
            int st=v1[i][j];
            update1(0,1,1,LIM-1,1,st);
        }
        for(j=0;j<v2[i].size();j++)
        {
            int st=v2[i][j];
            update1(1,1,1,LIM-1,1,st);
        }
        dp[i]=max(dp[i],query(0,1,1,LIM-1,1,i-1));
        dp[i]=max(dp[i],query(1,1,1,LIM-1,1,i-1));
        update2(0,1,1,LIM-1,i,dp[i]);
        update2(1,1,1,LIM-1,i,dp[i]);
       ans[dp[i]-1]=min(ans[dp[i]-1],i);
   }
    for(i=1;i<=n;i++)
    {
        update2(0,1,1,LIM-1,i,0);
        update2(1,1,1,LIM-1,i,0);
    }
	for(i=m-2;i>=0;i--)
		ans[i]=min(ans[i],ans[i+1]);
	for(i=0;i<m;i++)
		if(ans[i]==INT_MAX)
	      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;
}