#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5;
int n,t,N,num,a[M],b[M],lsh[M];
long long dis[M],tree[M];
vector<int>pos[M];
int p[M],f[M],pre[M],lazy[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
bool chkmin(long long &x,long long y){return x>y?x=y,1:0;}
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
bool Bellman_Ford(){
    for (int i=1;i<=N;i++){ bool flag=0;
        long long rec=dis[1]-lsh[1]/t,tmp=lsh[1]%t;
        for (int i=2;i<=N;i++){
            flag|=chkmin(dis[i],lsh[i]/t+rec+(lsh[i]%t>tmp));
            long long Rec=dis[i]-lsh[i]/t,Tmp=lsh[i]%t;
            if (Rec==rec&&tmp<Tmp||Rec<rec) rec=Rec,tmp=Tmp;
        }
        p[num=1]=N;
        for (int i=N-1;i;i--)
            if (dis[i]<dis[p[num]])
                p[++num]=i;
        reverse(p+1,p+num+1);
        for (int i=1;i<=num;i++) pre[p[i]]=p[i-1],lazy[p[i]]=0;
        for (int i=1;i<=num;i++)
            for (int j=p[i-1]+1;j<=p[i];j++)
                f[j]=p[i];
        for (int i=N-1;i;i--){
            for (auto j:pos[i]){
                int x=find(j); lazy[x]++;
                while (pre[x]&&dis[pre[x]]>dis[x]-lazy[x])
                    lazy[x]+=lazy[pre[x]],f[find(pre[x])]=find(x),pre[x]=pre[pre[x]];
            }
            int x=find(i+1);
            flag|=chkmin(dis[i],dis[x]-lazy[x]);
        }
        if (!flag) return 1;
    }
    return 0;
}
int main(){
    n=read();t=read();
    for (int i=1;i<=n;i++)
        a[i]=read()-1,b[i]=read()-t,
        lsh[++N]=a[i],lsh[++N]=b[i];
    sort(lsh+1,lsh+N+1);N=unique(lsh+1,lsh+N+1)-lsh-1;
    for (int i=1;i<=n;i++)
        a[i]=lower_bound(lsh+1,lsh+N+1,a[i])-lsh,
        b[i]=lower_bound(lsh+1,lsh+N+1,b[i])-lsh,
        pos[a[i]].emplace_back(b[i]);
    puts(Bellman_Ford()?"yes":"no");
    return 0;
}