#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

using graph=vector<vector<int>>;

void add_undirected_edge(graph& G,int u,int v){
	G[u].emplace_back(v);
	G[v].emplace_back(u);
}

pair<bool,vector<int>> two_coloring(const graph& G){
	int n=G.size();
	vector<int> color(n,-1);
	rep(u,n) if(color[u]==-1) {
		color[u]=0;
		queue<int> Q; Q.emplace(u);
		while(!Q.empty()){
			int v=Q.front(); Q.pop();
			for(int w:G[v]){
				if(color[w]==-1){
					color[w]=1-color[v];
					Q.emplace(w);
				}
				else if(color[w]==color[v]) return {false,vector<int>()};
			}
		}
	}
	return {true,color};
}

int main(){
	int n,m; scanf("%d%d",&n,&m);
	vector<int> l(n),r(n);
	rep(i,n) scanf("%d%d",&l[i],&r[i]);

	graph G(n);
	rep(i,n) for(int j=i+1;j<n;j++) {
		int cnt=0;
		if(l[j]<=r[i] && l[i]<=r[j]) cnt++;
		if(m-r[j]-1<=r[i] && l[i]<=m-l[j]-1) cnt++;
		if(cnt==1) add_undirected_edge(G,i,j);
		if(cnt==2) return puts("NO"),0;
	}

	puts(two_coloring(G).first?"YES":"NO");

	return 0;
}