#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <algorithm>
#include <set>

using namespace std;

#define rep(i,s,N) for(unsigned int i=s;i<N;i++)
typedef long long int lli;


int main(void)
{
	int N, S, D; cin >> N >> S >> D;
	vector<int> X(N), Y(N); 
	rep(i, 0, N)cin >> X[i] >> Y[i];
	string ans = "No";

	rep(i, 0, N) {
		if (X[i]<S && Y[i]>D) {
			ans = "Yes";
			break;
		}
	}
	cout << ans << endl;

	return 0;
}
 //
#include<bits/stdc++.h>

using namespace std;

#define PB push_back
#define f first
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

const int INF = 1000000007;
const ll MOD = 1000000007;

vector<pii> graph[301];

int dist[301];
bool seen[301];

void dijkstra(int src)
{
    for(int i=0; i<300; i++)
    {
        dist[i] = INF;
    }
    dist[src] = 0;
    priority_queue<pair<int, int>> pq;
    pq.push({0, src});
    while(!pq.empty())
    {
        int u = pq.top().s;
        pq.pop();
        for(int i=0; i<graph[u].size(); i++)
        {
            int v = graph[u][i].f;
            int w = graph[u][i].s;
            if(dist[v] > dist[u] + w)
            {
                dist[v] = dist[u] + w;
                if(!seen[v])
                    pq.push({-dist[v], v});
            }
        }
    }
}

void solve_test()
{
    int a, b, x, y;
    cin >> a >> b >> x >> y;
    for(int i=1; i<=100; i++)
    {
        graph[i].PB({i+100, x});
        graph[i+100].PB({i, x});
        if(i<100)
        {
            graph[i+1].PB({i, y});
            graph[i].PB({i+1, y});
            graph[i+101].PB({i+100, y});
            graph[i+100].PB({i+101, y});
        }
        if(i>1)
        {
            graph[i].PB({i+99, x});
            graph[i+99].PB({i, x});
        }
    }
    dijkstra(a);
    cout << dist[b+100];
}

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int tests;
    tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve_test();
    }
    return 0;
}
