#include<bits/stdc++.h>
using namespace std;
#define   sc(x) scanf("%d",&x)
#define   scll(x) scanf("%lld",&x)
#define   pb  push_back
#define   mp make_pair
#define   nl endl
#define   all(v) v.begin(), v.end()
#define   show(v) for(int x:v) cout<<x<<" "
#define   input(v) for(auto &x:v) cin>>x;
#define   send return

typedef  long long int lli;
typedef  long long  ll;


void solve(){
/*int n;
cin>>n;
vector<int> c(n),a(n),b(n);
input(c);
input(a);
input(b);
for(int i=1;i<n;i++){
    m.pb({a[i],b[i]});
}
int ans = 0,ANS = 0;
for(int i=1;i<=n;i++){
      if(i==1){
        ans += abs(a[i] - b[i]);

      }
      //else if(m[i].first == m[i].second) ANS = max(ans+c[i]-1,ANS),ans = 0;
    else if(i==n){
        ans += c[n-1]-1;
        ANS = max(ans,ANS);
    }

      else{
             ans += (c[i]-1) - abs(a[i] - b[i]);
             if(a[i] == b[i]){
                   ANS = max(ans,ANS);
                   ans = 0;
                }

      }
      ans+=2;
}



cout<<ANS;
int a,b,c;
cin>>a>>b>>c;
while(a>0 && b>0){
    if(c==0) a--,c=1;
    else if(c == 1) b--,c=0;
}
if(a==0) cout<<"Aoki";
else cout<<"Takahashi";*/
int n,s,d;
cin>>n>>s>>d;

for(int i=0;i<n;i++){
    int a,b;
    cin>>a>>b;

       if(a<s && b>d) {
       cout<<"Yes";
       return;
    }
}

 cout<<"No";
/*int n,m;
cin>>n>>m;
vector<pair<int,int>> h;
while(m--){
        int a,b;
      cin>>a>>b;
    h.pb({a,b});
}
int k;
cin>>k;
unordered_map<int,int> f;
while(k--)
{ int a,b;
  cin>>a>>b;
  f[a]++;
  f[b]++;
}
int cnt = 0;
for(pair<int,int> p : h){
    if(f[p.first] && f[p.second]) cnt++;
}
cout<<cnt;*/
}
int main(){


//lli t;
//scll(t);
//while(t--){
    solve();
    cout<<nl;
//}
}

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define int long long
#define fi(i,n) for(int i=0;i<n;i++)
#define f(i, a, b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define setzero(a) memset(a,0,sizeof(a))
#define prDouble(x) cout<<fixed<<setprecision(10)<<x;
#define SetBits(x) __builtin_popcount(x)
#define in_range(x, y, r, c) (x >= 0 && x < r && y >= 0 && y < c)
ll digits(ll n)
{
    return floor(log10(double(n))) + 1;
}
void faster()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}
ll modularExponentiation(ll x,ll n,ll M)
{
    ll result = 1;
    while(n>0)
    {
        if(n % 2 ==1)
        {
            result = ((result%M)*(x%M))%M;
        }
        x  = ((x%M)*(x%M))%M;
        n = n/2;
    }
    return result%M;
}
bool ispower(int n)
{
    if(n%2==1)
        return false;
    while(n>0)
    {
        if(n%2 == 1)
            return false;
        n = n/2;
    }
    return true;
}
int binomialCoeff(int n, int k)
{
    int C[n + 1][k + 1];
    int i, j;
    for (i = 0; i <= n; i++)
    {
        for (j = 0; j <= min(i, k); j++)
        {
            // Base Cases
            if (j == 0 || j == i)
                C[i][j] = 1;
            else
                C[i][j] = ((C[i - 1][j - 1])%MOD + (C[i - 1][j])%MOD)%MOD;
        }
    }
    return C[n][k]%MOD;
}
int32_t main()
{
    int n,s,d;
    cin>>n>>s>>d;
    bool ans = false;
    fi(i,n)
    {
        int x,y;
        cin>>x>>y;
        if(x < s && y > d)
            ans = true;
    }
    if(ans)
        cout<<"Yes";
    else
        cout<<"No";
}
