#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T>
inline bool dpmin(T& a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool dpmax(T& a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}

const string YES = "Yes";
const string NO = "No";

void solve(long long A, long long B, long long C) {
    if (A * A + B * B < C*C) {
        cout << YES << endl;
    } else {
        cout << NO << endl;
    }
}

// Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the
// default template now. You can remove this line by using your custom template)
int main()
{
    long long A;
    std::scanf("%lld", &A);
    long long B;
    std::scanf("%lld", &B);
    long long C;
    std::scanf("%lld", &C);
    solve(A, B, C);
    return 0;
}

#include<iostream> 
#include<algorithm> 
#include<vector> 
#include<string> 
#include<cstdlib> 
#include<cmath> 
#include<map> 
#include<queue> 
#include<stack> 
#include<set> 
#include<iomanip> 
#include<iterator> 
#include<sstream> 
using namespace std; 
const long long mod=1000000007; 
int main()
{
    long long n,m,t,a,b,k=0,h=0,r;
    cin>>n>>m>>t;
    r=n;
    while(m--)
    {
        cin>>a>>b;
        n-=(a-k);
        if(n<=0)
        {
            h++;
        }
        n+=(b-a);
        if(n>r)
        {
            n=r;
        }
        k=b;
    }
    n-=(t-k);
    if(n<=0)
    {
        h++;
    }
    if(h)
    {
        cout<<"No"<<endl;
    }
    else
    {
        cout<<"Yes"<<endl;
    }
    return 0;
}