#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

struct StronglyConnectedComponents {
    vector<vector<int>> gg, rg;
    vector<int> comp, order, seen;
    StronglyConnectedComponents(int v) : \
    gg(v), rg(v), comp(v, -1), seen(v, 0) { }
    void add_edge(int x, int y) {
        gg[x].emplace_back(y);
        rg[y].emplace_back(x);
    }
    int operator[](int k) { return comp[k]; }
    void dfs(int u) {
        seen[u] = true;
        for (int v: gg[u]) if (!seen[v]) dfs(v);
        order.emplace_back(u);
    }
    void rdfs(int u, int id) {
        comp[u] = id;
        for (int v: rg[u]) if (comp[v] == -1) rdfs(v, id);
    }
    vector<vector<int>> build() {
        for (int u = 0; u < gg.size(); ++u) if (!seen[u]) dfs(u);
        reverse(begin(order), end(order));
        int id = 0;
        for (int u: order) if (comp[u] == -1) rdfs(u, id++);
        vector<vector<int>> g_comp(id);
        set<pair<int, int>> connect;
        for (int u = 0; u < gg.size(); ++u) for (int v: gg[u]) {
            int x = comp[u], y = comp[v];
            if (x == y) continue;
            if (connect.count({x, y})) continue;
            g_comp[x].emplace_back(y);
            connect.emplace(x, y);
        }
        return g_comp;
    }
};

struct TwoSatisfiability : StronglyConnectedComponents {
    int sz;
    TwoSatisfiability(int v) : StronglyConnectedComponents(v + v), sz(v) {}
    void add_if(int u, int v) {     // u -> v <=> ¬v -> ¬u
        add_edge(u, v); add_edge(neg(v), neg(u));
    }
    void add_or(int u, int v) { add_if(neg(u), v); }    //  u or v  <=> ¬u -> v
    void add_nand(int u, int v) { add_if(u, neg(v)); }  // ¬(u ∧ v) <=> u -> ¬v
    void set_true(int v) { add_edge(neg(v), v); }       //  v <=> ¬v -> v
    void set_false(int v) { add_edge(v, neg(v)); }      // ¬v <=>  v -> ¬v
    int neg(int x) { return (x + sz) % (sz * 2); }
    bool solve() {
        build();
        for (int i = 0; i < sz; i++) {
            if ((*this)[i] == (*this)[neg(i)]) return false;
        }
        return true;
    }
};

int main() {
    int n, m; cin >> n >> m;
    vector<int> l(n), r(n);
    for (int i = 0; i < n; i++) cin >> l[i] >> r[i], r[i]++;
    TwoSatisfiability ts(n);
    auto lap = [&](int al, int ar, int bl, int br) {
        return max(al, bl) < min(ar, br);
    };
    #define ___(a, b) a, b
    #define REV(a, b) m - b, m - a
    #define NOT(i) ts.neg(i)
    for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
        if (lap(___(l[i], r[i]), ___(l[j], r[j]))) ts.add_nand(i, j);
        if (lap(___(l[i], r[i]), REV(l[j], r[j]))) ts.add_nand(i, NOT(j));
        if (lap(REV(l[i], r[i]), ___(l[j], r[j]))) ts.add_nand(NOT(i), j);
        if (lap(REV(l[i], r[i]), REV(l[j], r[j]))) ts.add_nand(NOT(i), NOT(j));
    }
    cout << (ts.solve() ? "YES" : "NO") << endl;
    return 0;
}