You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.

For each i, a_i ≠ b_i, a_i ≠ c_i, b_i ≠ c_i.

Find a sequence p_1, p_2, …, p_n, that satisfy the following conditions:

  * p_i ∈ \\{a_i, b_i, c_i\}
  * p_i ≠ p_{(i mod n) + 1}.



In other words, for each element, you need to choose one of the three possible values, such that no two adjacent elements (where we consider elements i,i+1 adjacent for i<n and also elements 1 and n) will have equal value.

It can be proved that in the given constraints solution always exists. You don't need to minimize/maximize anything, you need to find any proper sequence.

Input

The first line of input contains one integer t (1 ≤ t ≤ 100): the number of test cases.

The first line of each test case contains one integer n (3 ≤ n ≤ 100): the number of elements in the given sequences.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 100).

The third line contains n integers b_1, b_2, …, b_n (1 ≤ b_i ≤ 100).

The fourth line contains n integers c_1, c_2, …, c_n (1 ≤ c_i ≤ 100).

It is guaranteed that a_i ≠ b_i, a_i ≠ c_i, b_i ≠ c_i for all i.

Output

For each test case, print n integers: p_1, p_2, …, p_n (p_i ∈ \\{a_i, b_i, c_i\}, p_i ≠ p_{i mod n + 1}).

If there are several solutions, you can print any.

Example

Input


5
3
1 1 1
2 2 2
3 3 3
4
1 2 1 2
2 1 2 1
3 4 3 4
7
1 3 3 1 1 1 1
2 4 4 3 2 2 4
4 2 2 2 4 4 2
3
1 2 1
2 3 3
3 1 2
10
1 1 1 2 2 2 3 3 3 1
2 2 2 3 3 3 1 1 1 2
3 3 3 1 1 1 2 2 2 3


Output


1 2 3
1 2 1 2
1 3 4 3 2 4 2
1 3 2
1 2 3 1 2 3 1 2 3 2

Note

In the first test case p = [1, 2, 3].

It is a correct answer, because:

  * p_1 = 1 = a_1, p_2 = 2 = b_2, p_3 = 3 = c_3 
  * p_1 ≠ p_2 , p_2 ≠ p_3 , p_3 ≠ p_1 



All possible correct answers to this test case are: [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1].

In the second test case p = [1, 2, 1, 2].

In this sequence p_1 = a_1, p_2 = a_2, p_3 = a_3, p_4 = a_4. Also we can see, that no two adjacent elements of the sequence are equal.

In the third test case p = [1, 3, 4, 3, 2, 4, 2].

In this sequence p_1 = a_1, p_2 = a_2, p_3 = b_3, p_4 = b_4, p_5 = b_5, p_6 = c_6, p_7 = c_7. Also we can see, that no two adjacent elements of the sequence are equal.
import java.util.*;
import java.lang.*;
import java.io.*;

public class A {
    //-----------Integer Array Input----------
    static int[] readIntArray(int n){
        int arr[]=new int[n];
        for(int i=0;i<n;i++)
            arr[i]=scan.nextInt();
        return arr;
    }
    
    //-----------Long Array Input----------
    static long[] readLongArray(int n){
        long arr[]=new long[n];
        for(int i=0;i<n;i++)
            arr[i]=scan.nextLong();
        return arr;
    }
    
    //------------Boolean Array of Prime number----------------
    static boolean[] isPrimeArray(int e){
        boolean arr[] = new boolean[e+1];
        Arrays.fill(arr,true);
        arr[0]=false;
        arr[1]=false;
        for(int i=2;i*i<=e;i++){
            for(int j=2*i;j<=e;j+=i)
                arr[j]=false;
        }
        return arr;
            
    }
    
    //-----------Prime number Check----------------
    static boolean isPrime(int e){
        for(int i=2;i*i<=e;i++)
            if(e%i==0)
                return false;
        
        if(e==1) return false;
        return true;
    }
    
    //----------------Fast Power ------------------
    static long fastPower(long a,long b){
        long res=1;
        while(b>0){
            if(b%2!=0){
                res=(res*a%MOD)%MOD;
            }
            a=(a%MOD*a%MOD)%MOD;
            b=b>>1;
        }
        return res;
    }
    
    // ----------------Function for GCD(using recursion)-----------
    static long gcd(int a,int b){
    if(b==0)
        return a;
    else
        return gcd(b,a%b);
    }
    
    //---------Function for Counting Set Bits------------
    static int countSetBits(int n){
        int count=0;
        while(n>0){
            n=n&(n-1);
            count++;
        }
        return count;
    }
    
    //-------Function for lastDigit --------
    static boolean lastDigit(int n){
        int a=n;
        while(a>0){
            int ld=a%10;
            if(ld!=4 || ld!=7)
                return false;
            a=a/10;
        }
        return true;
    }
    
    //--------- Swap function--------------
    static int[] swap(int a,int b){
        int temp=a;
        b=a;
        a=temp;
        
        return (new int[]{a,b});
    }
    //---------- Inverse of a Number in Range of MOD-----------
    static long Inverse(long n) {
    	return fastPower(n,MOD-2);
    }
    //----------Multiplication of two NUMBERS IN MOD-------------
    static long multiply(long a,long b) {
    	return ((a%MOD * b%MOD)%MOD);
    }
    
    //-----------Factorial of a Number-------------
    static final int SIZE=1000003;
    static final long FACT[]=new long[SIZE];
	static void computeFactorial() {
		FACT[0]=1;
		for(int i=1;i<SIZE;i++) {
			FACT[i]=multiply(FACT[i-1],i);
		}
	}
	
	//---------------COMPUTER NcR_MOD------------
	static long NCR(long n,long r) {
		if(r==0 || r==n)
			return 1;
		return (multiply(multiply(FACT[(int) n],Inverse(FACT[(int) r])),Inverse(FACT[(int) (n-r)])));
	}
	
	//-------------------MOD----------------------
    static final long MOD=1000000007;
    
    //-----------PrintWriter for faster output---------------------------------
    static final PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
    
    //-----------MyScanner Object----------------------------------
    public static MyScanner scan = new MyScanner();
    
    //-----------------Main method----------------
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		int tc = scan.nextInt();
		//computeFactorial();
        for (int i = 0; i < tc; i++) {
            solve();
        }
		pw.close();
	}
	//-----------------Main function Ends here-----------------
	
	//------------Solve function for solving queries-----------------------
	private static void solve() {
		int n=scan.nextInt();
		int arr[][]=new int[3][n];
		for(int i=0;i<3;i++) {
			for(int j=0;j<n;j++)
				arr[i][j]=scan.nextInt();
		}
		
		StringBuffer sb=new StringBuffer();
		int rowcount=0;
		sb.append(arr[rowcount][0]+" ");
		for(int i=1;i<n;i++)
		{
			if(arr[rowcount][i-1]==arr[rowcount][i]) {
				rowcount++;
				if(rowcount==3)
					rowcount=0;
				sb.append(arr[rowcount][i]+" ");
			}
			else	
				sb.append(arr[rowcount][i]+" ");
		}
		pw.println(sb);
		
			
		
	    
    }
    //------------Solve function ends here-----------------
	
	

    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
    //-----------MyScanner class ends here------------------------
}
