#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, nn = 0, range;
  int a, b, c, d, pos, neg, ok = 1, finddd = 0;
  int ara[200], ara2[200];
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &ara[i], &ara2[i]);
    if (ara2[i] == m || ara[i] == m) {
      finddd = 1;
    }
  }
  if (n == 1 && ara[0] == 1) {
    finddd = 0;
  }
  for (int i = 1; i < n; i++) {
    for (int j = 0; j < i; j++) {
      if (ara[i] <= ara2[j]) {
        pos = 1;
      }
    }
    if (pos == 1) {
      ok = 1;
    } else {
      ok = 0;
      break;
    }
    pos = 0;
    neg = 0;
  }
  if (ok == 1 && finddd == 1) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
  return 0;
}
