#include struct _block{ int L, R; public: static int M; }; int _block::M = 0; bool is_yes(int const N, _block *block, int *tau){ int tau_id = N, T = -1; int min_L = _block::M, min_id = tau_id, temp = 0, i = 0; bool isTurn = false; _block *p = NULL; while(0 < tau_id){ min_L = _block::M; min_id = tau_id; temp = 0; isTurn = false; for(i = 0; i < tau_id; ++i){ p = block + tau[i]; if(T < (temp = p->L ) && min_L > temp){ min_L = temp; min_id = i; isTurn = false; } if(T < (temp = _block::M - 1 - p->R) && min_L > temp){ min_L = temp; min_id = i; isTurn = true ; } } if(tau_id == min_id){ return false; } if(!isTurn){ T = block[tau[min_id]].R; }else{ T = _block::M - 1 - block[tau[min_id]].L; } tau[min_id] = tau[tau_id - 1]; --tau_id; } return true; } int main(int argc, char *argv[]){ _block block[2002]; int tau[2002]; int N = 0; scanf("%d%d", &N, &_block::M); for(int k = 0; k < N; ++k){ tau[k] = k; scanf("%d%d", &block[k].L, &block[k].R); } printf("%s\n", ((is_yes(N, block, tau))? "YES" : "NO")); return 0; }