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 x=d.length;
       for(int i=0;i<x;i++)
        {
            for(int j=i+1;j<x;j++)
            {
                if(d[i]>d[j])
                {
                    int temp=d[i];
                    d[i]=d[j];
                    d[j]=temp;
                    
                    temp=s[i];
                    s[i]=s[j];
                    s[j]=temp;
                    
                    char temp1=t[i];
                    t[i]=t[j];
                    t[j]=temp1;
                }
            }
        }
        int[] finalList=new int[n];

        for(int i=0;i<n;i++)
        {
            
            finalList[i]=-1;
            int count=0;
            for(int j=0;j<x;j++)
            {
                count=0;
                ArrayList<Character> tempChar=new ArrayList<Character>();
                for(int k=0;k<n;k++)
                {
                    if(count==(i+1))
                    break;
                    char a,b;
                    if(t[k]=='E')
                    { a='M';b='D';}
                    else if(t[k]=='D')
                    {  a='E';b='C';}
                    else if(t[k]=='C')
                    {  a='D';b='M';}
                    else
                    {   a='E';b='D';}
                    if(!tempChar.contains(a)||!tempChar.contains(b))
                    {
                        tempChar.add(t[k]);
                        finalList[i]=d[k];
                        count++;
                    }
                }
                if(count!=i+1)
                {
                    finalList[i]=-1;
                    tempChar.clear();
                }
                else
                    break;
            }
            if(count!=i+1)
            {
                finalList[i]=-1;
                break;
            }
            

        }

        return finalList;
    }

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