#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

int main(int argc, const char * argv[]) {
    
    // source code
    int N = inputValue();
    int M = inputValue();
    int blocks[4000] = {0};
    rep(i, N){
        int left = inputValue();
        int right = inputValue();
        repd(j, left, right + 1){
            blocks[j] += 1;
        }
        repd(j, M - 1 - right, M - left){
            blocks[j] += 1;
        }
    }
    
    bool ret = true;
    rep(i, M){
        if (blocks[i] >=3) {
            ret = false;
            break;
        }
    }
    
    output((ret == true) ? "YES" : "NO", 0);
    
    return 0;
}