#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
ll inf=1000000000000000;
using mint=modint998244353;
using pint=pair<mint,mint>;

bool is_prime(int l1,int l2,int r1,int r2){
    return !((l1<=r2&&r2<=r1)||(l2<=r1&&r1<=r2));
}
int main()
{
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> s(n);
    for(int i=0;i<n;i++)cin>>s[i].first>>s[i].second;
    vector<vector<int>> graph(n*2);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i==j)continue;
            int l1=s[i].first,l2=s[j].first,r1=s[i].second,r2=s[j].second;
            if(!is_prime(l1,l2,r1,r2))graph[i].push_back(j+n);
            if(!is_prime(l1,m-1-r2,r1,m-1-l2))graph[i].push_back(j);
            if(!is_prime(m-1-r1,l2,m-1-l1,r2))graph[i+n].push_back(j+n);
            if(!is_prime(m-1-r1,m-1-r2,m-1-l1,m-1-l2))graph[i+n].push_back(j);

        }
    }

    function<bool(int,int,vector<bool>&)> dfs=[&](int i,int goal,vector<bool>& seen){
        if(seen[i])return false;
        else seen[i]=true;
        if(i==goal)return true;
        for(int x:graph[i]){
            if(dfs(x,goal,seen))return true;
        }
        return false;
    };

    bool ok=true;

    for(int i=0;i<n;i++){
        vector<bool> seen1(2*n),seen2(2*n);
        if(dfs(i,n+i,seen1)&&dfs(n+i,i,seen2))ok=false;


    }
    cout<<(ok?"YES":"No")<<endl;

    
}