#include <bits/stdc++.h>
using namespace std;
int from[101], to[101], p;
int main() {
  int n, m, x, y;
  cin >> n >> m;
  memset(to, -1, sizeof to);
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    for (int j = x; j <= y; j++) to[j] = max(to[j], y);
  }
  int now = 0;
  for (; now <= m;) {
    if (to[now] == -1 || to[now] == now) break;
    if (now == m || (now <= m and to[now] >= m)) {
      cout << "YES";
      return 0;
    }
    now = to[now];
  }
  cout << "NO";
  return 0;
}
