#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

class SCC{
private:
	vector<vector<int> > gg, rg;
	vector<int> order, comp;
	vector<bool> used;
	vector<vector<int> > ng, vs;

	int n, nn;
public:
	SCC(){}
	SCC(int v) : gg(v), rg(v), comp(v, -1), used(v, 0), n(v){}

	void add_edge(int x, int y){
		gg[x].push_back(y);
		rg[y].push_back(x);
	}

	int operator[](int k){
		return comp[k];
	}

	void dfs(int v){
		used[v] = true;
		REP(i, gg[v].size()){
			if(!used[gg[v][i]]) dfs(gg[v][i]);
		}
		order.push_back(v);
	}

	void rdfs(int v, int k){
		used[v] = true;
		comp[v] = k;
		REP(i, rg[v].size()){
			if(!used[rg[v][i]]) rdfs(rg[v][i], k);
		}
	}

	int build(){
		REP(i, n){
			if(!used[i]) dfs(i);
		}
		fill(all(used), 0);
		int k = 0;
		for(int i = order.size()-1;i >= 0;i--){
			if(!used[order[i]]) rdfs(order[i], k++);
		}
		nn = k;

		//---------それぞれの強連結成分に含まれる頂点の番号----------
		vs.resize(k, vector<int>());

		REP(i, n)
			vs[comp[i]].push_back(i);
		//-----------------------------------------------------------

		//---------強連結成分をまとめた後のNew Graph!----------------
		ng.resize(k, vector<int>());
		REP(i, n){
			REP(j, gg[i].size()){
				if(comp[i] != comp[gg[i][j]])
					ng[comp[i]].push_back(comp[gg[i][j]]);
			}
		}
		REP(i, nn){
			sort(all(ng[i]));
			ng[i].erase(unique(all(ng[i])), ng[i].end());
		}
		//------------------------------------------------------------
		return k;
	}
	
	int size(){
		return nn;
	}

	vector<vector<int> > graph(){
		return ng;
	}

	vector<int> vertices(int v){
		return vs[v];
	}
};
bool conflict(PII a, PII b){
	return ((a.first <= b.first && b.first <= a.second) || (a.first <= b.second && b.second <= a.second) || (b.first <= a.first && a.first <= b.second) || (b.first <= a.second && a.second <= b.second));
}

PII flip(PII a, int m){
	return {m-1-a.second, m-a.first-1};
}

int main(void){
	int n, m;
	PII b[4010];
	cin >> n >> m;
	
	SCC scc(2*n);
	REP(i, n){
		cin >> b[i].first >> b[i].second;
		b[i+n] = flip(b[i], m);
	}
	REP(i, n){
		REP(j, n){
			if(i == j) continue;
			int cnt = 0;
			if(conflict(b[i], b[j])){
				scc.add_edge(i, j+n);
				scc.add_edge(j, i+n);
				cnt++;
			}
			if(conflict(b[i], flip(b[j], m))){
				scc.add_edge(i, j);
				scc.add_edge(j+n, i+n);
				cnt++;
			}
			if(conflict(flip(b[i], m), b[j])){
				scc.add_edge(i+n, j+n);
				scc.add_edge(j, i);
				cnt++;
			}
			if(conflict(flip(b[i], m), flip(b[j], m))){
				scc.add_edge(i+n, j);
				scc.add_edge(j+n, i);
				cnt++;
			}
			if(cnt == 4){
				cout << "NO" << endl;
				return 0;
			}
		}
	}
	scc.build();
	REP(i, n){
		if(scc[i] == scc[i+n]){
			cout << "NO" << endl;
			return 0;
		}
	}
	cout << "YES" << endl;
}