#include<iostream> 
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<algorithm>
#define eps 1e-10
#define inf 1e9
#define For(i,j,k)	for(int i=j;i<=k;++i)
#define Dow(i,j,k)	for(int i=k;i>=j;--i)
#define ll long long
#define y1 orz
using namespace std;
inline ll read()
{
	ll t=0,f=1;char c=getchar();
	while(c<'0'||c>'9')	{if(c=='-')	f=-1;c=getchar();}
	while(c>='0'&&c<='9')	t=t*10+c-48,c=getchar();
	return t*f;
}
int n,h,F[1001],deg[1001],hav[1001],is_father[1001];
inline int get(int x){return x==F[x]?F[x]:F[x]=get(F[x]);}
int x,y,x1,y1,tx,ty;
int main()
{
	n=read();h=read();
	For(i,1,1000)	F[i]=i;
	For(i,1,n)	
	{
		x=read();y=read();x1=read();y1=read();
		if(x1==0)	tx=x;else tx=-x1;
		if(y1==0)	ty=-y;else ty=y1;
		tx+=500;ty+=500;
		deg[tx]++;deg[ty]--;hav[tx]=1;
//		cout<<tx<<' '<<ty<<endl;
		F[get(tx)]=get(ty);
	}
	For(i,501,1000)	if(deg[i]<0)	{puts("NO");return 0;}		
	For(i,1,500)	if(deg[i]>0)	{puts("NO");return 0;}
	For(i,1,1000)	
		hav[get(i)]|=hav[i];
	For(i,1,1000)
		if(deg[i])is_father[get(i)]=1;
	For(i,1,1000)	
		if(hav[i])
			if(F[i]==i&&!is_father[i])	return puts("NO"),0;
	puts("YES");
}