#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
vvll g, gbi;
vll see, in, out;
ll N, H;

bool dfs(ll u) {
	bool b = false;

	//cout << u << endl;
	see[u] = 1;
	if (u > H && in[u] < out[u]) {b=true; }
	for (ll v : gbi[u]) {
		if (see[v] == 1) { continue; }
		if (dfs(v)) {b=true; }
	}

	return b;
}

int main() {
	
	cin >> N >> H;

	vll A(N + 1), B(N + 1), C(N + 1), D(N + 1);
	repn(i, N) cin >> A[i] >> B[i] >> C[i] >> D[i];

	g.resize(2 * H + 1);
	repn(i, N) {
		if (C[i] == 0 && D[i] == 0) { g[H + A[i]].push_back(H - B[i]); }
		else if (C[i] == 0) { g[H + A[i]].push_back(H + D[i]); }
		else if (D[i] == 0) { g[H - C[i]].push_back(H - B[i]); }
		else { g[H - C[i]].push_back(H + D[i]); }
	}

	gbi.resize(2 * H + 1);
	rep(v, 2 * H + 1) {
		for (ll w : g[v]) {
			//cout << v << " " << w << endl;
			gbi[v].push_back(w);
			gbi[w].push_back(v);
		}
	}

	in.assign(2*H + 1, 0);
	out.assign(2*H + 1, 0);

	rep(v, 2 * H + 1) {
		out[v] = g[v].size();
		for (ll w : g[v]) { in[w]++; }
	}

	rep(v, 2 * H + 1) {
		if (v < H && in[v] < out[v]) { cout << "NO" << endl; return 0; }
		if (v > H && in[v] > out[v]) { cout << "NO" << endl; return 0; }
	}

	see.assign(2 * H + 1, 0);

	rep(v, 2 * H + 1) {
		if (see[v] == 1) { continue; }
		if (in[v] == 0 && out[v] == 0) { continue; }
		if (!dfs(v)) { cout << "NO" << endl; return 0; }
	}

	cout << "YES" << endl;
	
}

Measured memory_bytes: 10804