#include <iostream>
#include <vector>

class Line {
public:
	Line(const int &l = 0, const int &r = 0) :left(l), right(r) {}
	bool operator<(const Line &other) const {
		return left < other.left;
	}
	bool operator&(const Line &other) const {
		return (left - other.right) * (right - other.left) < 0;
	}
	void inspect() {
		std::cout << left << "-" << right << "\n";
	}
	int left, right;
};
template<typename T>
void sort(std::vector<T> &vector, const int &left, const int &right) {
	if (left < right) {
		auto l = left, r = right, pivot = (left + right) / 2;
		while (l < r) {
			while (vector.at(l) < vector.at(pivot)) ++l;
			while (vector.at(pivot) < vector.at(r)) --r;
			if (l < r) {
				auto temp = vector.at(l);
				vector.at(l) = vector.at(r); vector.at(r) = temp;
				++l; --r;
			}
			sort(vector, left, r); sort(vector, r + 1, right);
		}
	}
}
int main() {
	int n, m;
	std::cin >> n >> m;
	std::vector<Line> vector(2 * n);
	for (auto i = 0; i < n; ++i) {
		int l, r;
		std::cin >> l >> r;
		vector.at(2 * i) = Line(l, r);
		vector.at(2 * i + 1) = Line(m - r - 1, m - l - 1);
	}
	sort(vector, 0, (2 * n) - 1);
	bool flag = false;
	for (auto i = 2; i < 2 * n; ++i) {
		if (vector.at(i - 1) & vector.at(i) && vector.at(i - 2) & vector.at(i - 1) && vector.at(i - 2) & vector.at(i)) {
			//vector.at(i - 2).inspect(); vector.at(i - 1).inspect(); vector.at(i).inspect();
			flag = true;
			i = 2 * n;
		}
	}
	if (flag) {
		std::cout << "NO\n";
	}
	else{
		std::cout << "YES\n";
	}
	return 0;
}