#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0)
typedef long long ll;
const int N = 1e5 + 4 , MOD = 1e9 + 7 ;
int n , s , d ;
pair<int, int> p[N] ;
bool ok ;
bool solve(int idx)
{
if(idx == n + 1)
return (ok == 1) ;
if(p[idx].first < s && p[idx].second > d)
ok = 1 ;
solve(idx + 1) ;
return (ok == 1) ;
}
int main() {
IO ;
cin>>n>>s>>d ;
for(int i=1 ; i <= n ; i++)
cin>>p[i].first>>p[i].second ;
if(solve(1) == 1)
cout<<"Yes\n" ;
else
cout<<"No\n" ;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBJTyBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApLCBjaW4udGllKDApLGNvdXQudGllKDApCnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTiA9IDFlNSArIDQgLCBNT0QgPSAxZTkgKyA3IDsKaW50IG4gLCBzICwgZCA7CnBhaXI8aW50LCBpbnQ+IHBbTl0gOwpib29sIG9rIDsKYm9vbCBzb2x2ZShpbnQgaWR4KQp7CiAgICBpZihpZHggPT0gbiArIDEpCiAgICAgICAgcmV0dXJuIChvayA9PSAxKSA7CiAgICBpZihwW2lkeF0uZmlyc3QgPCBzICYmIHBbaWR4XS5zZWNvbmQgPiBkKQogICAgICAgIG9rID0gMSA7CiAgICBzb2x2ZShpZHggKyAxKSA7CiAgICByZXR1cm4gKG9rID09IDEpIDsKfQppbnQgbWFpbigpIHsKICAgIElPIDsKICAgIGNpbj4+bj4+cz4+ZCA7CiAgICBmb3IoaW50IGk9MSA7IGkgPD0gbiA7IGkrKykKICAgICAgICBjaW4+PnBbaV0uZmlyc3Q+PnBbaV0uc2Vjb25kIDsKICAgIGlmKHNvbHZlKDEpID09IDEpCiAgICAgICAgY291dDw8Illlc1xuIiA7CiAgICBlbHNlCiAgICAgICAgY291dDw8Ik5vXG4iIDsKCiAgICByZXR1cm4gMDsKfQ==