#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int A,B,C;
  cin>>A>>B>>C;

  if(A*A+B*B<C*C) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;

  return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    ll a, b, c, d;
    cin>>a>>b>>c>>d;


    if(b < c*d)
    {

        ll cy = a;
        ll r = 0;
        for(ll i = 0; ; i++)
        {
            //cout<<"r = "<<r<<" cy = "<<cy<<endl;
            if(r*d >= cy)
            {
                cout<<i<<endl;
                break;
            }
            cy += b;
            r += c;
        }
    }

    else
    {
        cout<<-1<<endl;
    }
    return 0;
}
