#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>it;
const int inf = 1e18;
const int N   = 2e5 + 5;
const int mod = 1000000007;

void testCase() {
    int a,b,c;
    cin>>a>>b>>c;

    if(a*a+b*b < c*c){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }


}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int  t = 1;
    // cin >> t;
    while (t--)testCase();
    return 0;
}
//#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<vector>
#define swap(x,y) (y -= (x = ((y += x) - x)))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define reps(i,n) for(int i = 1, i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define rreps(i,n) for(int i = (int)(n); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
using ll = long long;
using namespace std;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
int digit(ll n, int a) { int s = 0;	for (int i = 0; n > 0; i++) { s++;	n /= a; }	return s; }
int imax(int a[], int n) { int s = a[0];	rep(i, n) { s = max(s, a[i]); }	return s; }
int imin(int a[], int n) { int s = a[0];	rep(i, n) { s = min(s, a[i]); }	return s; }
int cmax(string a, int n) { int s = 0;	rep(i, n) { s = max(s, (int)a[i] - '0'); }	return s; }
int cmin(string a, int n) { int s = 9;	rep(i, n) { s = min(s, (int)a[i] - '0'); }	return s; }

//quick sort(int)
int ascfunc(const void* n1, const void* n2) {
	if (*(int*)n1 > *(int*)n2) {
		return 1;
	}
	if (*(int*)n1 < *(int*)n2) {
		return -1;
	}
	if (*(int*)n1 == *(int*)n2) {
		return 0;
	}
}

int main(void) {
	ll n, s, d;	cin >> n >> s >> d;
	ll* x = new ll[n];
	ll* y = new ll[n];
	bool can = false;
	rep(i, n) {
		cin >> x[i];
		cin >> y[i];
		if (x[i]<s && y[i]>d) {
			can = true;
		}
	}
	if (can) {
		cout << "Yes";
	}
	else {
		cout << "No";
	}

	cout << endl;
	delete[] x;	delete[] y;
	return 0;
}