/* -*- coding: utf-8 -*-
 *
 * 274.cc: No.274 The Wall - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 2000;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

/* subroutines */

/* main */

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

  priority_queue<pii> q;
  
  for (int i = 0; i < n; i++) {
    int li, ri;
    cin >> li >> ri;
    if (ri >= m - 1 - li) q.push(pii(ri, li));
    else q.push(pii(m - 1 - li, m - 1 - ri));
  }

  bool ok = true;
  int prv = m;

  while (! q.empty()) {
    pii u = q.top(); q.pop();
    int &ul = u.second, &ur = u.first;
    //printf("prv=%d: (%d,%d)\n", prv, ul, ur);

    if (ur >= prv) {
      int vl = m - 1 - ur, vr = m - 1 - ul;
      if (vr >= prv) {
	ok = false;
	break;
      }
      q.push(pii(vr, vl));
    }
    else
      prv = ul;
  }

  cout << (ok ? "YES" : "NO") << endl;
  return 0;
}