//Heaplax
#include<bits/stdc++.h>
#define LL long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
	while(ch=getchar(),ch<33);
	if(ch=='-')fs=1,x=0;else fs=0,x=ch-48;
	while(ch=getchar(),ch>33)x=x*10+ch-48;
	if(fs)x=-x;
}
using namespace std;
int n,h,in[405],out[405],f[405];
bool vis[405];
int find(int x)
{
	return f[x]==x?x:f[x]=find(f[x]);
}
int main()
{
	re(n),re(h);
	for(int i=1;i<=h*2;++i)f[i]=i;
	for(int i=1,a,b,c,d;i<=n;++i)
	{
		re(a),re(b),re(c),re(d);
		int l=0,r=0;
		if(c)l=c;else l=h+a;
		if(d)r=h+d;else r=b;
		if(find(l)!=find(r))f[f[l]]=f[r];
		++out[l];++in[r];
	}
	for(int i=1;i<=h;++i)if(out[i]>in[i])return puts("NO"),0;
	for(int i=h+1;i<=h+h;++i)if(out[i]<in[i])return puts("NO"),0;
	for(int i=1;i<=h+h;++i)if(in[i]!=out[i])vis[find(i)]=1;
	for(int i=1;i<=h+h;++i)if(in[i]&&out[i]&&!vis[find(i)])return puts("NO"),0;
	puts("YES");
}
