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 } 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(); } } public class animalTransport{ //Variables&Initialized int m(1,m);//no of zoos int n;//no of animals int t;//type of animal like e-elephant,d-dog,c-cat,m-mice int s;//source zoo public class minZooNumberTest{ int ni.ti.di*negitiveTransport(ni,ti,ci); int ti_di!=int ti_ci; int ni.ti.ei*negativeTransport(ni,ti,di); int ti_ei!=int ti_di; int ni.ti.mi*negativeTransport(ni,ti,ci); int ti_mi!=int ti_ci; int ni.ti.ei*negativewTransport(ni,ti,mi); int ti_ei!=int ti_mi; for(i=0;i<&>ni.Length_e,d,c,m,s;++i++) if{ int mi*int ni*int ti*int si*pairTransport(); int ti*int niint Length_ni*int si; int Length_ni*int si*assert(); ret int ni.ti=-1; } } }