//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popcount(x) __builtin_popcount(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class... T> void fin(const T&... a) { print(a...); exit(0); }
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    INT(n, s, d);
    rep(i, n) {
        INT(x, y);
        if (x >= s) continue;
        if (y <= d) continue;
        fin(Yes[1]);
    }
    fin(Yes[0]);
}

#include <bits/stdc++.h>

using namespace std;

const long long mod = 1e9 + 7;

long long add(long long a, long long b) {
    long long res = a + b;
    if (res >= mod) res -= mod;
    return res;
}

long long sub(long long a, long long b) {
    long long res = a - b + mod;
    if (res >= mod) res -= mod;
    return res;
}

long long mul(long long a, long long b) {
    return (((a % mod) * (b % mod)) % mod);
}

long long potolok(long long a, long long b){
    return (a + b - 1) / b;
}

long long gcd(long long x, long long y){
    if(y == 0){
        return x;
    }
    if(x == 0){
        return y;
    }
    if(x > y){
         return gcd(y, x % y);
    }
    else{
         return gcd(x, y % x);
    }
}

long long bin_pow(long long base, long long power, long long m){
    if(power == 1){
        return base;
    }
    if(power % 2 == 0){
        long long t = bin_pow(base, power / 2, m);
        return t * t % m;
    }
    else{
        return bin_pow(base, power - 1, m) * base % m;
    }
}

struct segtree{

    struct node{
        long long seg, pref, suf, sum;
    };

    node combine(node a, node b){
        return {
            max(a.seg, max(b.seg, a.suf + b.pref)),
            max(a.pref, a.sum + b.pref),
            max(b.suf, b.sum + a.suf),
            a.sum + b.sum
        };
    }

    node one_element(long long a){
        return {
            max(a, 0 * 1LL),
            max(a, 0 * 1LL),
            max(a, 0 * 1LL),
            a
        };
    }

    node ZERO = {0, 0, 0, 0};

    int razmer;

    vector<node> tree;

    void Init(vector<long long> &v){
        int n = (int)v.size();
        razmer = 1;
        while(razmer < n) razmer *= 2;
        tree.assign(2 * razmer - 1, {0, 0, 0, 0});
    }

    void build(vector<long long> &v, int x, int lx, int rx){
        if(rx - lx == 1){
            if(lx < (int)v.size()){
                tree[x] = one_element(v[lx]);
            }
        }else{
            int m = (lx + rx) / 2;
            build(v, 2 * x + 1, lx, m);
            build(v, 2 * x + 2, m, rx);
            tree[x] = combine(tree[2 * x + 1], tree[2 * x + 2]);
        }
    }

    void build(vector<long long> &v){
        build(v, 0, 0, razmer);
    }

    void cet(int i, int v, int x, int lx, int rx){
        if(rx - lx == 1){
            tree[x] = one_element(v * 1LL);
            return;
        }else{
            int m = (lx + rx) / 2;
            if(i < m){
                cet(i, v, 2 * x + 1, lx, m);
            }else{
                cet(i, v, 2 * x + 2, m, rx);
            }
            tree[x] = combine(tree[2 * x + 1], tree[2 * x + 2]);
        }
    }

    void cet(int i, int v){
        cet(i, v, 0, 0, razmer);
    }

    void show(){
        for(auto i : tree){
            cout << i.seg << " " << i.pref << " " << i.suf << " " << i.sum << '\n';
        }
    }
};

void solve(){
    //std::freopen("ancestor.in", "r", stdin);
    //std::freopen("ancestor.out", "w", stdout);
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    long long n, s, d;
    cin >> n >> s >> d;
    vector<pair<long long, long long>> v(n);
    for(int i = 0;i < n;i++){
        cin >> v[i].first >> v[i].second;
    }
    for(int i = 0;i < n;i++){
        if(v[i].first < s && v[i].second > d){
            cout << "Yes" << endl;
            return;
        }
    }
    cout << "No" << endl;
}

int main(){
    int t;
    t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
