#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert

#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}

using namespace std;

template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}

//-------------------------------------------------
//--Strongly Connected Components
//-------------------------------------------------
class SCC
{
private:
    using SCCGraph = vector<vector<int> >;
    int N,sz;
    SCCGraph G, rG;
    stack<int> st;
    vector<bool> seen;
    vector<int> belong;
    
    void dfs(int v){
        seen[v] = true;
        for(auto u:G[v]){
            if (seen[u]) continue;
            dfs(u);
        }
        st.push(v);
    }
    void rdfs(int v, int k){
        seen[v] = true;
        belong[v] = k;
        for(auto u:rG[v]){
            if (seen[u]) continue;
            rdfs(u,k);
        }
    }
public:
    SCC(int n):N(n),G(n),rG(n),seen(n),belong(n){}
    void add_edge(int u, int v){
        G[u].push_back(v);
        rG[v].push_back(u);
    }
    void build(){
        for(int v=0; v<N; v++) seen[v]=0;
        for(int v=0; v<N; v++)
            if (!seen[v]) dfs(v);
        for(int v=0; v<N; v++) seen[v]=0;
        sz=0;
        while(!st.empty()){
            int v = st.top(); st.pop();
            if (!seen[v]) rdfs(v,sz++);
        }
    }
    vector<vector<int> > get_list(){
        vector<vector<int> > ret(sz);
        for(int v=0; v<N; v++)
            ret[belong[v]].push_back(v);
        return ret;
    }
    int size(){return sz;};
    int operator[](int v){return belong[v];}
};

//-------------------------------------------------
//--Two SAT
//-------------------------------------------------
class TwoSAT
{
private:
    int N;
    SCC scc;
public:
    TwoSAT(int n):scc(n<<1),N(n){}
    void add_if(int x, bool f, int y, bool g){
        scc.add_edge(x<<1|f,y<<1|g);
        scc.add_edge(y<<1|!g,x<<1|!f);
    }
    void add_clause(int x, bool f, int y, bool g){
        scc.add_edge(x<<1|!f,y<<1|g);
        scc.add_edge(y<<1|!g,x<<1|f);
    }
    void add_var(int x, bool f){
        scc.add_edge(x<<1|!f,x<<1|f);
    }
    vector<bool> solve(){
        scc.build();
        vector<bool> ret(N);
        for(int i=0; i<N; i++){
            int u = scc[i<<1|1];
            int v = scc[i<<1];
            if (u > v)
                ret[i] = true;
            else if(u < v)
                ret[i] = false;
            else
                return vector<bool>();
        }
        return ret;
    }
};

struct Range {int l,r;};
bool cross(Range a, Range b){
    if (a.l>b.l) swap(a,b);
    return (b.l<=a.r);
}

//-------------------------------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M; cin>>N>>M;

    auto rev = [&](const Range &rg){
        return Range{M-rg.r-1, M-rg.l-1};
    };
    
    vector<Range> rs(N);
    rep(i,N){
        int l,r; cin>>l>>r;
        rs[i] = Range{l,r};
    }

    TwoSAT ts(N);
    rep(i,N)FOR(j,i+1,N-1){
        rep(f,2)rep(g,2){
            Range a = f?rev(rs[i]):rs[i];
            Range b = g?rev(rs[j]):rs[j];
            if (cross(a,b)) ts.add_clause(i,f,j,g);
        }
    }
    auto ans = ts.solve();
    cout<<(ans.empty()?"NO":"YES")<<"\n";

    return 0;
}