#include <bits/stdc++.h>
using namespace std;

#ifdef SG
	#include <debug.h>
#else
	template<typename T> struct outputer;
	struct outputable {};
	#define PRINT(...)
	#define OUTPUT(...)
	#define show(...)
	#define debug(...)
	#define deepen(...)
	#define timer(...)
	#define fbegin(...)
	#define fend
	#define pbegin(...)
	#define pend
#endif

#define ARG4(_1,_2,_3,_4,...) _4

#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)

#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)

#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb emplace_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())

typedef long double ld;
typedef int64_t ll;
typedef uint64_t ull;
typedef uint32_t ui;
typedef uint16_t us;
typedef uint8_t uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;

template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}

const int N = 100000;
const int H = 200;

struct Input {
	int n, h;
	int a[N], b[N], c[N], d[N];
	
	bool read () {
		if (!(cin >> n >> h)) {
			return 0;
		}
		forn (i, n) {
			scanf("%d%d%d%d", &a[i], &b[i], &c[i], &d[i]);
		}
		return 1;
	}

	void init (const Input &input) {
		*this = input;
	}
};

struct Data: Input {
	bool ans;
	
	void write () {
		puts(ans ? "YES" : "NO");
	}
};


namespace Main {
	
	struct Solution: Data {
		vi e[2 * H], f[2 * H];
		bool u[2 * H];
		
		bool dfs (int v) {
			if (u[v]) {
				return 0;
			}
			u[v] = 1;
			bool res = (sz(e[v]) != sz(f[v]));
			for (const auto &vec : {e[v], f[v]}) {
				for (int to : vec) {
					res |= dfs(to);
				}
			}
			return res;
		}
		
		void solve () {
			memset(f, 0, sizeof f);
			forn (i, n) {
				int u = c[i] ? h + c[i] - 1 : a[i] - 1;
				int v = d[i] ? d[i] - 1 : h + b[i] - 1;
				e[u].pb(v);
				f[v].pb(u);
			}
			forn (i, h) {
				if (sz(e[i]) < sz(f[i])) {
					ans = 0;
					return;
				}
			}
			forn (i, h, 2 * h) {
				if (sz(e[i]) > sz(f[i])) {
					ans = 0;
					return;
				}
			}
			forn (i, 2 * h) {
				if (sz(e[i]) + sz(f[i]) > 0 && !u[i]) {
					if (!dfs(i)) {
						ans = 0;
						return;
					}
				}
			}
			ans = 1;
		}
		
		void clear () {
			*this = Solution();
		}
	};
}


Main::Solution sol;

int main () {
	cout.setf(ios::showpoint | ios::fixed);
	cout.precision(20);

	#ifdef SG
		freopen((problemname + ".in").c_str(), "r", stdin);
//		freopen((problemname + ".out").c_str(), "w", stdout);
		while (sol.read()) {
			sol.solve();
			sol.write();
			sol.clear();
		}
	#else
		sol.read();
		sol.solve();
		sol.write();
	#endif
	
	/*
	int t;
	cin >> t;
	forn (i, t) {
		sol.read();
		sol.solve();
		sol.write();
		sol.clear();
	}
	*/
	
	return 0;
}


Measured memory_bytes: 3968