import java.util.Arrays;
import java.util.Scanner;


public class Main_yukicoder274 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        Pair[] b = new Pair[n * 2];
        for (int i = 0; i < n; i++) {
        	int l = sc.nextInt();
        	int r = sc.nextInt();
        	b[i * 2] = new Pair(l, r);
        	b[i * 2 + 1] = new Pair(m - 1 - r, m - 1 - l);
        }
        Arrays.sort(b);

        boolean flag = true;
        int pre1 = -1;
        int pre2 = -1;
        for (int i = 0; i < 2 * n; i++) {
        	if (b[i].l <= pre2) {
        		flag = false;
        		break;
        	}
        	int[] tmp = {pre1, pre2, b[i].r};
        	Arrays.sort(tmp);
        	pre1 = tmp[2];
        	pre2 = tmp[1];
        }

        if (flag) {
        	System.out.println("YES");
        } else {
        	System.out.println("NO");
        }

        sc.close();
    }
    
    private static class Pair implements Comparable<Pair> {
    	int l;
    	int r;
    	
    	Pair(int l, int r) {
    		this.l = l;
    		this.r = r;
    	}

    	@Override
		public int compareTo(Pair o) {
			return Double.compare(this.l, o.l);
		}
    }
}