import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static int ng=0; static int[] minimumZooNumbers(int m, int n, char[] t, int[] s, int[] d) { // Return a list of length n consisting of the answers int[] result = new int[n]; ArrayList ecs = new ArrayList(); ArrayList ecd = new ArrayList(); ArrayList dms = new ArrayList(); ArrayList dmd = new ArrayList(); char flag=' '; int sv=0; for(int i=0;i=dmd.size() && i>=ecd.size()) result[i]=-1; else if(i>=dmd.size()) {flag='e';result[i]=ecd.get(i);} else if(i>=ecd.size()) {flag='d';result[i]=dmd.get(i);} else { if(ecd.get(i)1) {if(containsgr(dms,result[i-1])) if((result[i]>(sv=dmd.get(dms.indexOf(ng)))) || result[i]==-1) { flag='d'; result[i]=sv; } else flag='e'; } else if(flag=='d' && i>1) {if(containsgr(ecs,result[i-1])) if(result[i]>(sv=ecd.get(ecs.indexOf(ng)))|| result[i]==-1) { flag='e'; result[i]=sv; } else flag='d'; } } return result; } static boolean containsgr(ArrayList a,int num) { Collections.sort(a); if(a.get(a.size()-1)>=num) { for(int y:a) if (y>=num) { ng=y; break; } return true; } return false; } 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(); } }