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

public class Solution {

    static int min(int n,int start,int end,char[] t, int[] s, int[] d,HashMap<Character,Integer> m)
    {
        if(n==0)
            return 0;
        return 0;
    }
    
   /* static int[] minimumZooNumbers(int m, int n, char[] t, int[] s, int[] d) {
        // Return a list of length n consisting of the answers
        return 0;
    }*/

    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 < n; i++) {
                //System.out.print(result[i] + (i != result.length - 1 ? " " : ""));
                System.out.print(-1+" ");
            }
            System.out.println("");


        }
        in.close();
    }
}