#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 20002
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int num,data;
	bool operator < (const reads &t)const
	{
		return data!=t.data?data<t.data:num>t.num;
	}
};
int n,m,k,tong[N+1],length,a[N+1],b[N+1],X[N+1],Y[N+1],C[N+1],rt[N+1],l[N+1],delta[N+1],dis[N+1],dis2[N+1];
bool used[N+1];
vector<int>p[N+1];
int find(int x)
{
	if (rt[x]==x) return x;
	return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
	delta[y]+=delta[x],l[y]=l[x],rt[x]=y;
	return;
}
int main()
{
	bool op;
	reads res;
	n=read(),k=read(),tong[++length]=-1,tong[++length]=inf;
	for (int i=1;i<=n;++i) a[i]=read()-1,b[i]=read()-k,tong[++length]=a[i],tong[++length]=b[i];
	sort(tong+1,tong+length+1),length=unique(tong+1,tong+length+1)-tong-1;
	for (int i=1;i<=n;++i) a[i]=lower_bound(tong+1,tong+length+1,a[i])-tong,b[i]=lower_bound(tong+1,tong+length+1,b[i])-tong,p[a[i]].push_back(b[i]);
	for (int i=2;i<=length;++i) dis2[i]=dis[i]=inf;
	for (int i=1;i<=length;++i)
	{
		dis[length]=min(dis[length],dis[1]+n);
		for (int j=length-1;j>=1;--j) dis[j]=min(dis[j],dis[j+1]);
		res=(reads){inf,inf};
		for (int j=1;j<=length;++j) dis[j]=min(dis[j],res.data+(tong[j]+1)/k+(res.num<(tong[j]+1)%k)),res=min(res,(reads){(tong[j]+1)%k,dis[j]-(tong[j]+1)/k});
		for (int j=1;j<=length;++j) rt[j]=l[j]=j;
		for (int j=length;j>=1;--j)
		{
			if (j+1<=length)
			{
				for (int k=0;k<p[j].size();++k)
				{
					delta[find(p[j][k])]--;
					while (l[find(p[j][k])]!=j+1&&delta[find(p[j][k])]<0) unionn(l[find(p[j][k])]-1,find(p[j][k]));
				}
				dis[j]=min(dis[j],delta[find(j+1)]);
			}
			delta[j]=dis[j];
			if (j+1<=length)
			{
				delta[find(j+1)]-=dis[j];
				while (l[find(j+1)]&&delta[find(j+1)]<0) unionn(l[find(j+1)]-1,find(j+1));
			}
		}
		op=1;
		for (int j=1;j<=length;++j) op&=(dis[j]==dis2[j]),dis2[j]=dis[j];
		if (op)
		{
			puts("yes");
			return 0;
		}
		if (dis[1]<0)
		{
			puts("no");
			return 0;
		}
	}
	puts("no");
	return 0;
}