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

class Animal {
	int type;
	int start;
	int end;

	Animal(int type, int start, int end) {
		this.type = type;
		this.start = start;
		this.end = end;
	}
}

class FinishComparator implements Comparator<Animal> {
	@Override
	public int compare(Animal a1, Animal a2) {
		if (a1.end <= a2.end) {
			return -1;
		} else {
			return 1;
		}
	}
}

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
		Animal[] animals = new Animal[n];
		for (int i = 0; i < n; i++) {
			int type = 0;
			if (t[i] == 'E' || t[i] == 'C') {
				type = 1;
			}
			animals[i] = new Animal(type, s[i], d[i]);
		}
		return minimumZooNumber(animals);

	}

	static int[] minimumZooNumber(Animal[] animals) {
		int currentCapacity[] = new int[animals.length];
		Arrays.fill(currentCapacity, 1);
		FinishComparator comparator = new FinishComparator();
		Arrays.sort(animals, comparator);

		for (int i = 1; i < animals.length; i++) {
			currentCapacity[i] = currentCapacity[i - 1];
			for (int j = i - 1; j >= 0; j--) {
				if (animals[j].end <= animals[i].start || animals[j].type == animals[i].type) {
					currentCapacity[i] = Math.max(currentCapacity[i], 1 + currentCapacity[j]);
					break;
				}
			}
		}

		int n = animals.length;
		int result[] = new int[n];
		Arrays.fill(result, -1);
		for (int i = 1; i <= n; i++) {

			for (int j = 0; j < n; j++) {
				if (currentCapacity[j] == i) {
					result[i - 1] = animals[j].end;
					break;
				}
			}
		}

		return result;
	}

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