#include <iostream>
#include <utility>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

using P = pair<int, int>;

struct Segment {
    int lb, ub;
    bool flipped;

    bool operator>(const Segment& s) const {
        return ub == s.ub ? (lb < s.lb) : (ub > s.ub);
    }
};

int main() {
    int n, m;
    cin >> n >> m;

    priority_queue<Segment, vector<Segment>, greater<Segment>> que;
    for (int i = 0; i < n; i++) {
        int l, r;
        cin >> l >> r;
        Segment s1 = (Segment){l, r, false},
                s2 = (Segment){m - 1 - r, m - 1 - l, false};
        if (s1 > s2) {
            que.push(s2);
        } else {
            que.push(s1);
        }
    }

    int prev = -1, num = 0;
    while (!que.empty()) {
        Segment s = que.top(); que.pop();
        int l = s.lb, r = s.ub;
        if (l > prev) {
            prev = r;
            num++;
        } else if (!s.flipped) {
            Segment s2 = (Segment){m - 1 - r, m - 1 - l, true};
            que.push(s2);
        }
    }
    if (num == n) cout << "YES" << endl;
    else cout << "NO" << endl;

    return 0;
}