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 Codeforces {

    public static void main(String[] args) throws IOException {
        FastScanner fs = new FastScanner();
        PrintWriter pw = new PrintWriter(System.out);
        int t = 0;
        t = fs.getInt();
        while (t-- > 0) {
            int a = fs.getInt();
            int b = fs.getInt();
            int c = fs.getInt();
            int d = fs.getInt();

            if (b == 0 && c == 0) {
                if (a % 2 == 0) {
                    pw.println("Tidak Tidak Tidak Ya");
                } else {
                    pw.println("Ya Tidak Tidak Tidak");
                }
            } else if (a == 0 && d == 0) {
                if (b % 2 == 0) {
                    pw.println("Tidak Tidak Ya Tidak");
                } else {
                    pw.println("Tidak Ya Tidak Tidak");
                }
            } else {
                if ((a + b) % 2 == 0) {
                    pw.println("Tidak Tidak Ya Ya");
                } else {
                    pw.println("Ya Ya Tidak Tidak");
                }
            }
        }
        pw.close();
    }

}

class MOD {
    static long mod = 1000000007;

    static long add(long x, long y) {
        long result = x + y;
        return result > mod ? result - mod : result;
    }

    static long sub(long x, long y) {
        long result = x - y;
        return result < 0 ? result + mod : result;
    }

    static long mul(long x, long y) {
        long result = x * y;
        return result >= mod ? result % mod : result;
    }

    static long pow(long x, long y) {
        long result = 1;
        x %= mod;
        while (y > 0) {
            if ((y & 1) == 1)
                result = mul(result, x);
            x = mul(x, x);
            y = y >>> 1;
        }
        return result;
    }

    static long modInv(long x) {
        return pow(x, mod - 2);
    }

}

class Utility {

    static int ceil(int a, int b) {
        if (a == 0)
            return 0;
        return (a - 1) / b + 1;
    }

    static long ceil(long a, long b) {
        if (a == 0)
            return 0;
        return (a - 1) / b + 1;
    }

    static int gcd(int a, int b) {
        if (a > b) {
            int t = a;
            a = b;
            b = t;
        }
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    static long gcd(long a, long b) {
        if (a > b) {
            long t = a;
            a = b;
            b = t;
        }
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    static int binarySearch(int[] ar, int x, int start, int end) {
        int l = start;
        int r = end;
        while (l <= r) {
            int mid = l + (r - l) / 2;
            if (ar[mid] == x) {
                return mid;
            } else if (ar[mid] > x) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        return -1;
    }

    static int lowerBound(int[] ar, int x) {
        int l = 0;
        int r = ar.length - 1;
        while (l <= r) {
            int mid = l + (r - l) / 2;

            if (ar[mid] >= x)
                r = mid - 1;
            else
                l = mid + 1;
        }
        return r + 1;
    }

    static int upperBound(int[] ar, int x) {
        int l = 0;
        int r = ar.length - 1;
        while (l <= r) {
            int mid = l + (r - l) / 2;

            if (ar[mid] > x)
                r = mid - 1;
            else
                l = mid + 1;
        }
        return l;
    }

    static void sort(int[] a) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int i : a)
            l.add(i);
        Collections.sort(l);
        for (int i = 0; i < a.length; i++)
            a[i] = l.get(i);
    }

    static void sort(long[] a) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : a)
            l.add(i);
        Collections.sort(l);
        for (int i = 0; i < a.length; i++)
            a[i] = l.get(i);
    }

    static boolean isPalindrome(String s) {
        char[] ss = s.toCharArray();
        int i = 0;
        int j = s.length() - 1;

        while (i < j) {
            if (ss[i] != ss[j]) {
                return false;
            }
            i += 1;
            j -= 1;
        }
        return true;
    }

    static boolean isPrime(int n) {
        if (n <= 1)
            return false;
        else if (n == 2)
            return true;
        else if (n % 2 == 0)
            return false;
        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    static void printArray(int[] ar) {
        for (int i = 0; i < ar.length; i++) {
            System.out.print(ar[i] + " ");
        }
        System.out.println();
    }

    static void printArray(long[] ar) {
        for (int i = 0; i < ar.length; i++) {
            System.out.print(ar[i] + " ");
        }
        System.out.println();
    }

    static void printIntList(List<Integer> list) {
        for (int i = 0; i < list.size(); i++) {
            System.out.print(list.get(i) + " ");
        }
        System.out.println();
    }

    static void printLongList(List<Long> list) {
        for (int i = 0; i < list.size(); i++) {
            System.out.print(list.get(i) + " ");
        }
        System.out.println();
    }

    static long choose(long n, long k) {
        if (n < k)
            return 0;
        if (k == 0 || k == n)
            return 1;
        return choose(n - 1, k - 1) + choose(n - 1, k);
    }

    static List<Integer> divisors(int n) {
        List<Integer> list = new ArrayList<>();
        for (int i = 1; i * i < n; i++) {
            if (n % i == 0)
                list.add(i);
        }
        for (int i = (int) Math.sqrt(n); i >= 1; i--) {
            if (n % i == 0)
                list.add(n / i);
        }
        return list;
    }

}

class Pair implements Comparable<Pair> {
    Integer first;
    Integer second;

    Pair(Integer f, Integer s) {
        this.first = f;
        this.second = s;
    }

    public String toString() {
        return "(" + this.first + ", " + this.second + ")";
    }

    @Override
    public boolean equals(Object object) {
        if (((Pair) object).first == this.first && ((Pair) object).second == this.second && object instanceof Pair) {
            return true;
        } else {
            return false;
        }
    }

    @Override
    public int hashCode() {
        return (String.valueOf(first) + ":" + String.valueOf(second)).hashCode();
    }

    @Override
    public int compareTo(Pair p) {
        int f = first.compareTo(p.first);
        if (f != 0)
            return f;

        return Integer.compare(second, p.second);
    }
}

class FastScanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

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

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

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

    int[] getIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = getInt();
        return a;
    }

    long[] getLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = getLong();
        return a;
    }

    List<Integer> getIntList(int n) {
        List<Integer> list = new ArrayList<>();
        for (int i = 0; i < n; i++)
            list.add(getInt());
        return list;
    }

    List<Long> getLongList(int n) {
        List<Long> list = new ArrayList<>();
        for (int i = 0; i < n; i++)
            list.add(getLong());
        return list;
    }
}