#include <bits/stdc++.h>
using namespace std;
#define MAX 50004
#define INF 1000000000
typedef vector<int> vi;
struct node
{
    int ini,fin,id;
    node(){}
    node(int pini,int pfin,int pid):ini(pini),fin(pfin),id(pid){}
    bool operator <(const node& x) 
    {
        if(ini!=x.ini)
            return ini<x.ini;
        else
            return fin<x.fin;
    }
};
vector<node> vDM;
vector<node> vEC;
vector<vector<int> > g;
int ans[MAX];
bool visit[MAX];
//int parents_count[MAX];
int counter[MAX];
char let[MAX];
int cor[MAX][3];
void dfsDM(int countDM,int countEC);
void dfsEC(int countEC,int countDM)
{
    if(countEC<vEC.size())
        visit[vEC[countEC].id]=true;
    else
        return;
    while(countDM<vDM.size() && vDM[countDM].ini<vEC[countEC].fin)
        countDM++;
    for(int i=countDM;i<vDM.size();i++)
    {
        g[vEC[countEC].id].push_back(vDM[i].id);
        //parents_count[vDM[i].id]++;
        //cout<<vEC[countEC].id
        if(!visit[vDM[i].id])
        {   
            visit[vDM[i].id]=true;
            dfsDM(i,countEC);
        }
        else
	break;
    }  
    for(int i=countEC+1;i<vEC.size();i++)
    {
        g[vEC[countEC].id].push_back(vEC[i].id);
        //parents_count[vEC[i].id]++;
        if(!visit[vEC[i].id])
        {   
            visit[vEC[i].id]=true;
            dfsEC(i,countDM);
        }
        else
	break;
    }    
}
void dfsDM(int countDM,int countEC)
{
    if(countDM<vDM.size())
    visit[vDM[countDM].id]=true;
    else return;
    while(countEC<vEC.size() && vEC[countEC].ini<vDM[countDM].fin)
        countEC++;
    for(int i=countEC;i<vEC.size();i++)
    {
        g[vDM[countDM].id].push_back(vEC[i].id);
        //parents_count[vEC[i].id]++;
        if(!visit[vEC[i].id])
        {   
            visit[vEC[i].id]=true;
            dfsEC(i,countDM);
        }
        else break;
    }  
    for(int i=countDM+1;i<vDM.size();i++)
    {
        g[vDM[countDM].id].push_back(vDM[i].id);
       // parents_count[vDM[i].id]++;
        if(!visit[vDM[i].id])
        {   
            visit[vDM[i].id]=true;
            dfsDM(i,countEC);
        }
        else break;
    }    
}
vi color; // 0: Not discovered, 1: Discovered, 2: Processed
vi sorted; // The array will contain a valid topological sort
void dfs_visit(int v) // v: Current node
{
    color[v] = 1; // Mark node v as discovered
    for(int i = 0; i < (int)g[v].size(); i++) // For each neighbor of v..
    {
        int u = g[v][i]; // Neighbor u. Edge v -> u
        if(color[u] == 0) // If the node u has not been discovered..
            dfs_visit(u); // Visit node u
    }
    color[v] = 2; // Node v is now processed
    sorted.push_back(v); // Add the processed node v
}
void topsort(int n)
{
    color = vi(n, 0); // No node has been discovered
    sorted.clear(); // Clean the topological sort array
    for(int i = 0; i < n; i++) // For each node i..
        if(color[i] == 0) // If the node i has not been discovered..
            dfs_visit(i); // Visit the connected component
    reverse(sorted.begin(),sorted.end()); // Reverse the array
}
void dfs(int x)
{
   //cout<<x<<" "<<counter[x]<<endl;
    ans[counter[x]]=min(ans[counter[x]],cor[x][2]);

    for(int i=0;i<g[x].size();i++)
    {
    	counter[g[x][i]]=max(counter[g[x][i]],counter[x]+1);
    	ans[counter[g[x][i]]]=min(ans[counter[g[x][i]]],cor[g[x][i]][2]);
    }
	
}
int main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t,n,m;
    
    cin>>t;
    while(t--)
    {
        cin>>m>>n;
        vDM=vector<node>();
        vEC=vector<node>();
        g=vector<vector<int> >(n);
        for(int j=0;j<3;j++)
            for(int i=0;i<n;i++)
            {
                if(j==0)
                    cin>>let[i];
                else
                    cin>>cor[i][j];
        
            }
        for(int i=0;i<n;i++)
        {
            if(let[i]=='D'||let[i]=='M')
            {
                if(cor[i][2]>=cor[i][1])
                    vDM.push_back(node(cor[i][1],cor[i][2],i));
            }
            else
            {
                if(cor[i][2]>=cor[i][1])
                    vEC.push_back(node(cor[i][1],cor[i][2],i));
            }
        }
        sort(vDM.begin(),vDM.end());
        sort(vEC.begin(),vEC.end());
        //cout<<vDM.size()<<" "<<vEC.size()<<endl;
        /*for(int i=0;i<vDM.size();i++)
            cout<<vDM[i].ini<<" "<<vDM[i].fin<<" "<<vDM[i].id<<endl;
        for(int i=0;i<vEC.size();i++)
            cout<<vEC[i].ini<<" "<<vEC[i].fin<<" "<<vEC[i].id<<endl;*/
        for(int i=0;i<=n+1;i++)
            ans[i]=INF;
        memset(visit,false,sizeof visit);

        dfsDM(0,0);
        dfsEC(0,0);
        
        topsort(n);
        
        memset(visit,false,sizeof visit);
        memset(counter,0,sizeof counter);
        for(int i=0;i<=n+1;i++)
	counter[i]=1;
        for(int i=0;i<sorted.size();i++)
        {
        	dfs(sorted[i]);
        }
            
        for(int i=1;i<=n;i++)
        {
            if(i>1)
                cout<<" ";
            cout<<(ans[i]==INF?-1:ans[i]);
        }
        cout<<"\n";
        /*for(int i=0;i<vDM.size();i++)
            if(!visit[vDM[i].id])
            {
                dfsDM(i,0);
            }
        for(int i=0;i<vEC.size();i++)
            if(!visit[vEC[i].id])
            {
                dfsEC(i,0);
            }*/
    }
    return 0;
}