Problem: Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.

Masha decides to construct the square of size m × m consisting of the given tiles. This square also has to be a symmetric with respect to the main diagonal matrix, and each cell of this square has to be covered with exactly one tile cell, and also sides of tiles should be parallel to the sides of the square. All placed tiles cannot intersect with each other. Also, each tile should lie inside the square. See the picture in Notes section for better understanding.

Symmetric with respect to the main diagonal matrix is such a square s that for each pair (i, j) the condition s[i][j] = s[j][i] holds. I.e. it is true that the element written in the i-row and j-th column equals to the element written in the j-th row and i-th column.

Your task is to determine if Masha can construct a square of size m × m which is a symmetric matrix and consists of tiles she has. Masha can use any number of tiles of each type she has to construct the square. Note that she can not rotate tiles, she can only place them in the orientation they have in the input.

You have to answer t independent test cases.

Input

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

The first line of the test case contains two integers n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of types of tiles and the size of the square Masha wants to construct.

The next 2n lines of the test case contain descriptions of tiles types. Types of tiles are written one after another, each type is written on two lines. 

The first line of the description contains two positive (greater than zero) integers not exceeding 100 — the number written in the top left corner of the tile and the number written in the top right corner of the tile of the current type. The second line of the description contains two positive (greater than zero) integers not exceeding 100 — the number written in the bottom left corner of the tile and the number written in the bottom right corner of the tile of the current type.

It is forbidden to rotate tiles, it is only allowed to place them in the orientation they have in the input.

Output

For each test case print the answer: "YES" (without quotes) if Masha can construct the square of size m × m which is a symmetric matrix. Otherwise, print "NO" (withtout quotes).

Example

Input


6
3 4
1 2
5 6
5 7
7 4
8 9
9 8
2 5
1 1
1 1
2 2
2 2
1 100
10 10
10 10
1 2
4 5
8 4
2 2
1 1
1 1
1 2
3 4
1 2
1 1
1 1


Output


YES
NO
YES
NO
YES
YES

Note

The first test case of the input has three types of tiles, they are shown on the picture below.

<image>

Masha can construct, for example, the following square of size 4 × 4 which is a symmetric matrix:

<image>

Solution (in JAVA):

Solution:
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author WhysoseriousONI
 */
import java.util.*;
import java.io.*;

public class B {

    /* TEMPLATE STARTS HERE */
    long mod = (long) 1e+7;

    long ADD(long a, long b) {
        return (((a % mod) + (b % mod)) % mod);

    }

    long SUB(long a, long b) {
        return ((((a % mod) - (b % mod)) + mod) % mod);
    }

    long MUL(long a, long b) {
        return ((a % mod) * (b % mod) % mod);
    }

    long POW(long base, long e) {
        if (e == 0) {
            return 1;
        }
        long half = POW(base, e / 2);
        if (e % 2 == 0) {
            return MUL(half, half);
        }
        return MUL(half, MUL(base, half));
    }

    long INV(long x) {
        return POW(x, mod - 2);
    }

    long DIV(long a, long b) // a/b
    {
        return MUL(a, INV(b));
    }

    static final Random random = new Random();

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

    static void ruffleSort(int[] a) {
        int n = a.length;//shuffle, then sort
        for (int i = 0; i < n; i++) {
            int oi = random.nextInt(n), temp = a[oi];
            a[oi] = a[i];
            a[i] = temp;
        }
        Arrays.sort(a);
    }

    static 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 nextInt() {
            return Integer.parseInt(next());
        }

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

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

        String[] readStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) {
                a[i] = next();
            }
            return a;
        }

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

    static boolean[] sieve() {
        boolean primes[] = new boolean[40000];
        Arrays.fill(primes, true);
        primes[0] = false;
        primes[1] = false;
        for (int i = 2; i * i < 40000; i++) {
            if (primes[i]) {
                for (int j = i * i; j < 40000; j += i) {
                    primes[j] = false;
                }
            }
        }
        return primes;
    }

    static boolean prime[] = sieve();

    static int[] freqPrimeDivFactors(int n) {
        int freqprimediv[] = new int[40000];
        for (int i = 39999; i > 0; i--) {
            if (prime[i]) {
                int div = i;
                while (n % i == 0) {
                    freqprimediv[i]++;
                    n = n / i;
                }
            }
        }
        return freqprimediv;
    }

    /* TEMPLATE ENDS HERE */
    //void main
    public static void main(String[] args) {
        FastScanner ss = new FastScanner();
        int t = ss.nextInt();
        while (t-- != 0) {
            int n = ss.nextInt();
            int m = ss.nextInt();
            int arr[][] = new int[2 * n][2];

            for (int i = 0; i < 2 * n; i++) {
                for (int j = 0; j < 2; j++) {
                    arr[i][j] = ss.nextInt();
                }
            }
//            for (int i = 0; i < 2 * n; i++) {
//                System.out.println(Arrays.toString(arr[i]));
//            }
//            int check = ;
            if ((m & 1) == 1) {
                System.out.println("NO");
                continue ;
            }
            a:
            {
                boolean cond = false;

                for (int i = 0; i < 2 * n; i += 2) {
//                System.out.println("i "+i);
//                System.out.println(arr[i][0] +" "+ arr[i+1][1] +" "+ arr[i + 1][0] +" "+ arr[i][1]);
                    if ( arr[i + 1][0] == arr[i][1]) {
                        cond = true;
                        break;
                    }
                }
                if (cond) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            }
        }

    }
}