#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,a,b)  for(ll i=a;i<=b;i++)
#define FORR(i,a,b) for(ll i=a;i>=b;i--)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define rep(i,n) for(ll i=0;i<n;i++)
#define vl vector<ll>
#define vi vector<int>
#define ld long double
#define vld vector<ld>
#define vvl vector<vector<ll> >
#define vvi vector<vector<int> >
#define vvld vector<vector<ld> >
#define pll pair<ll,ll>
#define vpll vector<pll>
#define fi first
#define se second
#define pb push_back
#define pf push_front //only for deque
#define mp make_pair
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end())
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#define lb(v,val) lower_bound(v.begin(),v.end(),val)
#define sortv(vec) sort(vec.begin(),vec.end())
#define rsortv(vec) sort(vec.begin(),vec.end(), greater<ll>())
#define mset(a,val) memset(a,val,sizeof(a));
#define PI 3.14159265358979323846264338327950288419716939937510
#define yes cout<<"YES"<<"\n"
#define no cout<<"NO"<<"\n"
#define FAST std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

const ll N = 2e5 + 5;
const ll INF = 10000000000000;
const ll mod= 1e9 +7;
ll mind(ll x, ll y)
{
    if (x < y) {
        return x;
    }
    else
    {
        return y;
    }
}

ll poww(ll a, ll b) {
  if (b < 0 || a <= 0)return 0;
  ll ans = 1LL;
  while (b) {
    if (b & 1)ans = ans * a;
    a = a * a;
    b >>= 1;
  }
  return ans;
}

ll gcd(ll a,ll b){
    if(b==0)
        return a;
    return gcd(b,a%b);
}
ll getSum(ll num)
    {
        ll sum = 0;
        while (num != 0) {
            sum = sum + num % 10;
            num = num / 10;
        }
        return sum;
    }
 ll isPrime(ll num){
    if(num<=1)return 0;
    for(ll i=2; i*i<=num; i++){
        if(num%i==0){
            return 0;
        }
    }
    return 1;
}
int retMaxDig(int num){
    string s= to_string(num);
    int max= 0;
    rep(i,s.size()){
        if(s[i]-'0'>max)max=s[i]-'0';
    }
    return max;
}
ll decimalToBinary(ll num)
{
 
    // To store the binary number
    ll B_Number = 0;
    ll cnt = 0;
    while (num != 0) {
        ll rem = num % 2;
        ll c = poww(10, cnt);
        B_Number += rem * c;
        num /= 2;
 
        // Count used to store exponent value
        cnt++;
    }
 
    return B_Number;
}
ll binomialCoeff(ll n, ll k)
{
    ll res = 1;
    if(n<k){
      res= 0;
      return res;
    }
    // Since C(n, k) = C(n, n-k)
    if (k > n - k)
        k = n - k;
 
    // Calculate value of
    // [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
    for (ll i = 0; i < k; ++i) {
        res *= (n - i);
        res /= (i + 1);
    }
 
    return res;
}
ll isPalindrome(string str){
    ll num= str.size();
    FOR(i,0,(num-1)/2){
        if(str[i]!=str[num-i-1]){
            return 0;
        }
    }
    return 1;
}
 ll factorial(ll n)
{
    if(n == 0)
          return 1;
    ll i = n, fact = 1;
    while (n / i != n) {
        fact = fact * i;
        i--;
    }
    return fact;
}
//////////////////////////////END OF TEMPLATE//////////////////////////////

int main(){

  #ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  #endif
  FAST; 


  ll a,b,c;cin>>a>>b>>c;
  if(a*a+b*b<c*c)cout<<"Yes";
  else cout<<"No";


return 0;

}









#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fo(i,n) for (int i = 0; i <n; i++)
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    t = 1;
  // cin >> t;
    while(t--)
    {
      ll n=0,c1=0,i=0,sum=0,k1=0,j=0,k2=0;
      string s="";
   ll a,b,c;
   cin>>a>>b>>c;a*=a;b*=b;c*=c;
   cout<<((a+b)<c?"Yes":"No");
   
    cout<<endl;    
}}