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[] ret = new int[m];
        calcAtPosition(ret, m, n, t, s, d, 1, 0, 0, 0);

        int[] analyse = new int[n];

        int index = 0;
        for (int i = 0; i < ret.length; i++) {
            while (ret[i] > index) {
                analyse[index] = i + 1;
                index++;
            }
        }

        for (int i = index; i < analyse.length; i++) {
            analyse[i] = -1;
        }

        return analyse;
    }
    
    private static void calcAtPosition(int[] data, int m, int n, char[] t, int[] s, int[] d,
                                       int position, int dmCount, int ceCount, int delivered) {
        if (position > m)
            return;
        //Commit
        for (int i = 0; i < n; i++) {
            if (d[i] == position) {
                if (t[i] == 'D' || t[i] == 'M') {
                    if (dmCount > 0) {
                        dmCount--;
                        delivered++;
                    }
                } else {
                    if (ceCount > 0) {
                        ceCount--;
                        delivered++;
                    }
                }
            }
        }
        if (data[position - 1] < delivered)
            data[position - 1] = delivered;
        
        //Start
        for (int i = 0; i < n; i++) {
            if (s[i] == position) {
                if (t[i] == 'D' || t[i] == 'M') {
                    dmCount++;
                } else {
                    ceCount++;
                }
            }
        }

        if (dmCount > 0)
            calcAtPosition(data, m, n, t, s, d, position + 1, dmCount, 0, delivered);
        if (ceCount > 0)
            calcAtPosition(data, m, n, t, s, d, position + 1, 0, ceCount, delivered);
        if (ceCount == 0 && dmCount == 0)
            calcAtPosition(data, m, n, t, s, d, position + 1, 0, 0, delivered);
    }

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