#include <bits/stdc++.h>

using namespace std;
const int N = 1e6;

int n, h;
int a[N], b[N], c[N], d[N], vis[N], in[N], out[N], fa[N];

int read(void) {
    int s = 0, w = 0;
    char c = getchar();
    while (c < '0' || c > '9') w |= c == '-', c = getchar();
    while (c >= '0' && c <= '9') s = s * 10 + c - 48, c = getchar();
    return w ? -s : s;
}

int get(int x) {
	if (fa[x] == x) return x;
	return fa[x] = get(fa[x]); 
}

bool check(void)
{
	for (int i=-h;i<0;++i) 
		if (in[i+h] > out[i+h]) return 0;
	for (int i=1;i<=h;++i)
	    if (in[i+h] < out[i+h]) return 0;
	for (int i=-h;i<=h;++i)
	    if (in[i+h] != out[i+h]) vis[get(i+h)] = 1;
	    else if (in[i+h] +out[i+h] == 0) vis[get(i+h)] = 1;
	for (int i=-h;i<=h;++i)
		if (vis[get(i+h)] == 0) return 0;
	return 1;
	
}

int main(void)
{
	n = read(), h = read();
	for (int i=0;i<=1000;++i) fa[i] = i;
	for (int i=1;i<=n;++i)
	{
		a[i] = read(); b[i] = read();
		c[i] = read(); d[i] = read();
		int x = c[i] == 0 ? h-a[i] : h+c[i];
		int y = d[i] == 0 ? h+b[i] : h-d[i];
		out[x] ++, in[y] ++;
		fa[get(x)] = get(y);
	}
	if (check()) cout << "YES";
	else cout << "NO";
	return 0;
}