Problem: Chaneka has a hobby of playing with animal toys. Every toy has a different fun value, a real number. Chaneka has four boxes to store the toys with specification: 

  * The first box stores toys with fun values in range of (-∞,-1]. 
  * The second box stores toys with fun values in range of (-1, 0). 
  * The third box stores toys with fun values in range of (0, 1). 
  * The fourth box stores toys with fun value in range of [1, ∞). 



Chaneka has A, B, C, D toys in the first, second, third, and fourth box, respectively. One day she decides that she only wants one toy, a super toy. So she begins to create this super toy by sewing all the toys she has.

While the number of toys Chaneka has is more than 1, she takes two different toys randomly and then sews them together, creating a new toy. The fun value of this new toy is equal to the multiplication of fun values of the sewn toys. She then puts this new toy in the appropriate box. She repeats this process until she only has one toy. This last toy is the super toy, and the box that stores this toy is the special box.

As an observer, you only know the number of toys in each box initially but do not know their fun values. You also don't see the sequence of Chaneka's sewing. Determine which boxes can be the special box after Chaneka found her super toy.

Input

The first line has an integer T (1 ≤ T ≤ 5 ⋅ 10^4), the number of test cases.

Every case contains a line with four space-separated integers A B C D (0 ≤ A, B, C, D ≤ 10^6, A + B + C + D > 0), which denotes the number of toys in the first, second, third, and fourth box, respectively.

Output

For each case, print four space-separated strings. Each string represents the possibility that the first, second, third, and fourth box can be the special box from left to right.

For each box, print "Ya" (Without quotes, Indonesian for yes) if that box can be the special box. Print "Tidak" (Without quotes, Indonesian for No) otherwise.

Example

Input


2
1 2 0 1
0 1 0 0


Output


Ya Ya Tidak Tidak
Tidak Ya Tidak Tidak

Note

For the first case, here is a scenario where the first box is the special box: 

  * The first box had toys with fun values \{-3\}. 
  * The second box had toys with fun values \{ -0.5, -0.5 \} 
  * The fourth box had toys with fun values \{ 3 \} 



The sewing sequence: 

  1. Chaneka sews the toy with fun -0.5 and -0.5 to a toy with fun 0.25 and then put it in the third box. 
  2. Chaneka sews the toy with fun -3 and 0.25 to a toy with fun -0.75 and then put it in the second box. 
  3. Chaneka sews the toy with fun -0.75 and 3 to a toy with fun -1.25 and then put it in the first box, which then became the special box. 



Here is a scenario where the second box ends up being the special box: 

  * The first box had toys with fun values \{-3\} 
  * The second box had toys with fun values \{ -0.33, -0.25 \}. 
  * The fourth box had toys with fun values \{ 3 \}. 



The sewing sequence: 

  1. Chaneka sews the toy with fun -3 and -0.33 to a toy with fun 0.99 and then put it in the third box. 
  2. Chaneka sews the toy with fun 0.99 and 3 to a toy with fun 2.97 and then put in it the fourth box. 
  3. Chaneka sews the toy with fun 2.97 and -0.25 to a toy with fun -0.7425 and then put it in the second box, which then became the special box. 

There is only one toy for the second case, so Chaneka does not have to sew anything because that toy, by definition, is the super toy.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
 
public class Main {
 
	//static int [] arr;
	//static boolean prime[] = new boolean[1000]; 
	//static List<Long> al = new ArrayList<>();
	//static int l;
	//static String s; static StringBuilder sb;
	//static HashSet<L> hs;
	static HashSet<Long> hs = new HashSet<Long>();
	static int[] arr;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int t = sc.nextInt();
        //int t = 1;
        // sieve(600);
        while (t-->0) {
        	int A = sc.nextInt(), B = sc.nextInt() ,C = sc.nextInt() ,D = sc.nextInt() ;
        	if(A==0 && D == 0){
    			if(B % 2 == 1){
    				out.println("Tidak Ya Tidak Tidak");
    			} else {
    				out.println("Tidak Tidak Ya Tidak");
    			}
    		} else if(B == 0 && C == 0){
    			if(A % 2 == 1){
    				out.println("Ya Tidak Tidak Tidak");
    			} else {
    				out.println("Tidak Tidak Tidak Ya");
    			}
    		} else {
    			if((A+B) % 2 == 1){
    				out.println("Ya Ya Tidak Tidak");
    			} else{
    				out.println("Tidak Tidak Ya Ya");
    			}
    		}
    }


        
        	
        out.close();
    }
    static int nCr(int n, int r) 
    { 
        return fact(n) / (fact(r) * 
                      fact(n - r)); 
    } 
      
    // Returns factorial of n 
    static int fact(int n) 
    { 
        int res = 1; 
        for (int i = 2; i <= n; i++) 
            res = res * i; 
        return res; 
    }
    static void solve(int l , int r) {
    	if(l==r) {
    		hs.add((long)arr[l]);
    		return;
    	}
    	if(l>r)
    		return;
    	if(arr[l] == arr[r]) {
    		hs.add((long)(r-l+1)*arr[l]);
    		return;
    	}
    	int mid = arr[l] + (arr[r]-arr[l])/2;
    	
    	long sum = 0; int i;
    	for(i = l ; i<= arr.length && arr[i]<=mid ; i++)
    		sum+= arr[i];
    	hs.add(sum);
    	solve(l,i-1);
    	
    	sum = 0;
    	for(i = r;  i>=0 && arr[i]>mid ; i--)
    		sum+= arr[i];
    	hs.add(sum);
    	solve(i+1,r);
    }

//    static boolean check(long n) {
//    	String s = n +"";
//    	for(int i = 0 ; i < s.length() ; i++) {
//    		if(s.charAt(i)=='0')
//    			continue;
//    		int x = Character.getNumericValue(s.charAt(i));
//    		if(n%x!=0)
//    			return false;
//    	}
//    	return true;
//    }
//    public static int solve(int arr[] , int n , int x) {
//    	if(isSorted(arr))
//    		return 0;
//    	int count = 0;
//    	for(int i = 0 ; i < n ; i++) {
//    		for(int j = 0 ; j < n ; j++) {
//    			if(x<arr[i]) {
//    				int temp = arr[i];
//    				arr[i] = x;
//    				x = temp;
//    				count++;
//    				if(isSorted(arr))
//    					return count;
//    			}
//    		}
//    	}
//    	return -1;
//    }
//    public static boolean isSorted (int [] arr) {
//    	for(int i = 0 ; i < arr.length -1 ; i++)
//    		if(arr[i]>arr[i+1])
//    			return false;
//    	return true;
//    }

     


        

    }

//    static void findsubsequences(String s, String ans){
//    	if (s.length() == 0) {
//    		if(ans!="")
//    			if(ans.length()!=l)
//    			al.add(Long.parseLong(ans));
//    		return;
//	}
//
//		// We add adding 1st character in string
//		findsubsequences(s.substring(1), ans + s.charAt(0));
//		
//		// Not adding first character of the string
//		// because the concept of subsequence either
//		// character will present or not
//		findsubsequences(s.substring(1), ans);
//}
    

    

    
//    static void sieve(int n) 
//    { 
//        // Create a boolean array "prime[0..n]" and initialize 
//        // all entries it as true. A value in prime[i] will 
//        // finally be false if i is Not a prime, else true. 
//        
//        for(int i=0;i<n;i++) 
//            prime[i] = true; 
//          
//        for(int p = 2; p*p <=n; p++) 
//        { 
//            // If prime[p] is not changed, then it is a prime 
//            if(prime[p] == true) 
//            { 
//                // Update all multiples of p 
//                for(int i = p*p; i <= n; i += p) 
//                    prime[i] = false; 
//            } 
//        } 
//    }
 //Print all prime numbers 
//        for(int i = 2; i <= n; i++) 
//        { 
//            if(prime[i] == true) 
//                System.out.print(i + " "); 
//        } 
    

 

    

	class Pair  implements Comparable <Pair>{
		int a ;
		int b ;
		public Pair(int a , int b) {
			this.a = a;
			this.b = b;
		}
		@Override
		public int compareTo(Pair o) {
			// TODO Auto-generated method stub
			return this.a-o.a;
		}
		public String toString() {
			return "( " + this.a + " , " + this.b + " )\n";
		}
		
	}

	
	
	
	
	 class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public int[][] nextInt2DArr(int l, int w) throws IOException {
			int [][] arr = new int[l][w];
			for(int i = 0 ; i < l ; i++)
				for(int j = 0 ; j<w ; j++)
				arr[i][j]= Integer.parseInt(next());
			return arr;
		}

		public Scanner(String file) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(file));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
		public int[] nextIntArr(int length) throws IOException {
			int[] arr = new int[length];
			for(int i = 0 ; i < length ; i++)
				arr[i] = Integer.parseInt(next());
			return arr;
		}
		public boolean ready() throws IOException {
			return br.ready();
		}
	 }