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:
//package MyJavaProject;
 
import java.util.*;
import java.lang.Math;
import java.util.concurrent.TimeUnit;
import java.util.stream.Collectors;
import java.io.*;
import java.math.BigInteger;  

public class Test 
{
	static class FastReader 

	    { 
	        BufferedReader br; 
	        StringTokenizer st; 
	  
	        public FastReader() 
	        { 
	            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; 
	        } 
	    }


	static void print(String s)
	{
		System.out.print(s);
	}
	static void print(boolean s)
	{
		System.out.print(s);
	}
	 
	static long power(long x, long y)
	{
			long p=1000000007;
	        // Initialize result 
	        long res = 1;      
	         
	        // Update x if it is more   
	        // than or equal to p 
	        x = x % p;  
	  
	        if (x == 0) return 0; // In case x is divisible by p;    
	  
	        while (y > 0) 
	        { 
	            // If y is odd, multiply x 
	            // with result 
	            if((y & 1)==1) 
	                res = (res%p * x%p) % p; 
	      
	            // y must be even now 
	            // y = y / 2 
	            y = y >> 1;  
	            x = (x%p * x%p) % p;  
	        } 
	        return res; 
	    }
	static boolean isPrime(long n) 
	{ 
		// Corner cases 
		if (n <= 1) 
			return false; 
		if (n <= 3) 
			return true; 

		// This is checked so that we can skip 
		// middle five numbers in below loop 
		if (n % 2 == 0 || n % 3 == 0) 
			return false; 

		for (int i = 5; i * i <= n; i = i + 6) 
			if (n % i == 0 || n % (i + 2) == 0) 
				return false; 

		return true; 
	} 

	static FastReader f=new FastReader();
	static long[] inArr(long a[],int n)
	{
		for(int i=0;i<n;i++)
			a[i]=f.nextLong();
		return(a);
	}
	
	static void printSubsets(int set[]) 
    { 
        int n = set.length; 
        Arrays.sort(set);
        for(int i=0;i<n;i++)
        {
        	
        }
       HashMap<Integer,Integer> hm=new HashMap<>();
        for (int i = 0; i < (1<<n); i++) 
        { 
            for (int j = 0; j < n; j++) 
            {
            	if ((i & (1 << j)) > 0) {
                	if(hm.get(set[j])==null)
                	{
                		hm.put(set[j],0);
                	}
                	hm.put(set[j],hm.get(set[j])+1);
                	
                }
            }
              
            
     
                	
            
            	
        } 
    } 
	
  
	 static long gcd(long a, long b) 
	    { 
	    if (a == 0) 
	        return b;  
	    return gcd(b % a, a);  
	    } 
	      
	    // method to return LCM of two numbers 
	 static long lcm(long a, long b) 
	    { 
	        return (a*b)/gcd(a, b); 
	    } 
	 static long power(long x, long y, long p) 
	    { 
	  
	        // Initialize result 
	        long res = 1; 
	  
	        // Update x if it is more than or 
	        // equal to p 
	        x = x % p; 
	  
	        while (y > 0) { 
	  
	            // If y is odd, multiply x 
	            // with result 
	            if (y % 2 == 1) 
	                res = (res * x) % p; 
	  
	            // y must be even now 
	            y = y >> 1; // y = y/2 
	            x = (x * x) % p; 
	        } 
	  
	        return res; 
	    } 
	  
	    // Returns n^(-1) mod p 
	    static long modInverse(long n, long p) 
	    { 
	        return power(n, p - 2, p); 
	    } 
	  
	    // Returns nCr % p using Fermat's 
	    // little theorem. 
	    static long nCrModPFermat(int n, int r) 
	    { 
	    	long p=1000000007;
	  
	        // Base case 
	        if (r == 0) 
	            return 1; 
	  
	        // Fill factorial array so that we 
	        // can find all factorial of r, n 
	        // and n-r 
	        long[] fac = new long[n + 1]; 
	        fac[0] = 1; 
	  
	        for (int i = 1; i <= n; i++) 
	            fac[i] = fac[i - 1] * i % p; 
	  
	        return (fac[n] * modInverse(fac[r], p) 
	                % p * modInverse(fac[n - r], p) 
	                % p) 
	            % p; 
	    } 
	public static void main(String args[]) throws Exception
	{
		
		BufferedWriter w=new BufferedWriter(new OutputStreamWriter(System.out));
		Random rand = new Random();
		int t=f.nextInt();
		int tc=0;
		while(t--!=0)
		{
			int n=f.nextInt();
			int m=f.nextInt();
			int c=0;
			int a[][]=new int[2][2];
			for(int i=0;i<n;i++)
			{
				a[0][0]=f.nextInt();
				a[0][1]=f.nextInt();
				a[1][0]=f.nextInt();
				a[1][1]=f.nextInt();
				
				int flag=1;
				for(int j=0;j<2;j++)
				{
					for(int k=0;k<2;k++)
					{
						if(a[j][k]!=a[k][j])
						{
							flag=0;
							break;
									
						}
					}
					if(flag==0)
						break;
				}
				if(flag==1)
					c++;
					
			}
			
			if(m%2!=0)
			{
				w.write("NO\n");
				
			}
			else
			{
				if(c>0)
					w.write("YES\n");
				else
					w.write("NO\n");
			}
		}
		w.flush();
		
		
		
		
	}
}