import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int[] minimumZooNumbers(int m, int n, char[] t, int[] s, int[] d) {
        // Return a list of length n consisting of the answers
               
        int temp = 0;  
         for(int i=0; i < n; i++){  
                 for(int j=1; j < (n-i); j++){  
                          if(d[j-1] > d[j]){  
                                 
                                 temp = d[j-1];  
                                 d[j-1] = d[j];  
                                 d[j] = temp; 
                                 
                                 temp = s[j-1];  
                                 s[j-1] = s[j];  
                                 s[j] = temp;
                                 
                                 temp = t[j-1];  
                                 t[j-1] = t[j];  
                                 t[j] = (char)temp; 
                                 
                         }      
                 }  
         }
         int ele=0,dog=0,dml=0,ecl;
         int[] ec = new int[n];
         int[] dm = new int[n];
         int[] total = new int[n];
         int flag = -1;
        for(int i=0;i<n;i++){
            if(t[i]=='E' || t[i]=='C'){
                ec[ele]=d[i];
                ele++;
                flag=1;
            }
            else{
                dm[dog]=d[i];
                dog++;
                flag =0;
            }
            if(i< n-2 && (flag ==1 && t[i+1]=='M' || t[i+1]=='D') && s[i+1]>=d[i] && d[i+1]<=s[i+2] ){
                ec[ele]=d[i+1];
                ele++;
                flag =0;
            }
            else if(i< n-2 &&(flag ==0 && t[i+1]=='E' || t[i+1]=='C')&& s[i+1]>=d[i] && d[i+1]<=s[i+2] ){
                dm[dog]=d[i+1];
                dog++;
                flag = 1;
            }
        }
        dml = dm.length;
        ecl = ec.length;
       for(int i=0;i<dog && i<ele;i++){
           if(ec[i]<dm[i])
               total[i]=ec[i];
           else
               total[i]=dm[i];
       }
        if(dog>ele){
            for(int i=ele;i<dog;i++){
                total[i]=dm[i];
            }
             for(int i=dog;i<n;i++){
                total[i]=-1;
            }
        }
        else{
            for(int i=dog;i<ele;i++){
                total[i]=ec[i];
            }
            for(int i=ele;i<n;i++){
                total[i]=-1;
            }
        }
        return total;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int cases = in.nextInt();
        for(int a0 = 0; a0 < cases; a0++){
            int m = in.nextInt();
            int n = in.nextInt();
            char[] t = new char[n];
            for(int t_i = 0; t_i < n; t_i++){
                t[t_i] = in.next().charAt(0);
            }
            int[] s = new int[n];
            for(int s_i = 0; s_i < n; s_i++){
                s[s_i] = in.nextInt();
            }
            int[] d = new int[n];
            for(int d_i = 0; d_i < n; d_i++){
                d[d_i] = in.nextInt();
            }
            int[] result = minimumZooNumbers(m, n, t, s, d);
            for (int i = 0; i < result.length; i++) {
                System.out.print(result[i] + (i != result.length - 1 ? " " : ""));
            }
            System.out.println("");


        }
        in.close();
    }
}