#include "bits/stdc++.h"
using namespace std;
#define OUT(x) cout << #x << " = " << x << endl
#define rep(i, n)             for (int (i) = 0; (i) < (int)(n); (i)++)
#define rer(i, l, r)          for (int (i) = (int)(l); (i) <= (int)(r); (i)++)
#define reu(i, l, r)          for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define all(x)                (x).begin(), (x).end()
#define rall(x)               (x).rbegin(), (x).rend()
template<typename T> void pv(T a, T b) { for (T i = a; i != b; i ++) cout << *i << " "; cout << endl; }
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }
int in() { int x; scanf("%d", &x); return x; }
long long lin() { long long x; scanf("%lld", &x); return x; }

int V;
vector<int> g[101010];
vector<int> rg[101010];
vector<int> order;
bool used[101010];
int cmp[101010];

void add_edge(int from, int to) {
        g[from].push_back(to);
        rg[to].push_back(from);
}
void dfs(int v) {
        used[v] = true;
        for (auto i : g[v]) if (!used[i]) dfs(i);
        order.push_back(v);
}
void rdfs(int v, int k) {
        used[v] = true;
        cmp[v] = k;
        for (auto i : rg[v]) if (!used[i]) rdfs(i, k);
}
int StronglyConnectedComponent() {
        memset(used, 0, sizeof(used));
        order.clear();
        for (int i = 0; i < V; i ++) if (!used[i]) dfs(i);
        memset(used, 0, sizeof(used));
        int k = 0;
        for (int i = order.size() - 1; i >= 0; i --) if (!used[order[i]]) rdfs(order[i], k ++);
        return k;
}

bool chofuku(int l, int r, int s, int t) {
        if ((l <= s && s <= r) || (s <= l && l <= t) || (l <= s && t <= r) || (s <= l && r <= t)) return true;
        return false;
}

signed main() { 
        int n, m;
        cin >> n >> m;
        V = 2 * n;
        vector<int> l(n), r(n);
        rep(i, n) {
                int ll, rr;
                cin >> ll >> rr;
                l[i] = ll;
                r[i] = rr;
        }
        rep(i, n) for (int j = i + 1; j < n; j ++) {
                int ll = m - r[i] - 1, rr = m - l[i] - 1;
                //OUT(ll);
                //OUT(rr);
                //OUT(l[i]);
                //OUT(r[i]);
                //OUT(l[j]);
                //OUT(r[j]);
                if (chofuku(l[i], r[i], l[j], r[j]) && chofuku(ll, rr, l[j], r[j])) {
                        cout << "NO" << endl;
                        return 0;
                } else if (chofuku(l[i], r[i], l[j], r[j]) && !chofuku(ll, rr, l[j], r[j])) {
                        add_edge(i, j + n);
                        add_edge(j + n, i);
                        add_edge(j, i + n);
                        add_edge(i + n, j);
                } else if (!chofuku(l[i], r[i], l[j], r[j]) && chofuku(ll, rr, l[j], r[j])) {
                        add_edge(i, j);
                        add_edge(j, i);
                        add_edge(i + n, j + n);
                        add_edge(j + n, i + n);
                }
        }
        StronglyConnectedComponent();
        rep(i, n) {
                if (cmp[i] == cmp[i + n]) {
                        cout << "NO" << endl;
                        return 0;
                }
        }
        cout << "YES" << endl;
        return 0;
}