/***Bismillahhirrahmannirrahim***/
/***coding is fun if u enjoy it***/
 
 
#include<bits/stdc++.h>


#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

 
using namespace std;


 
 
/*** Input-Output ***/
 
#define pf   printf
 
#define sfi(t)     scanf("%d",&t)
#define sfi2(a,b)  scanf("%d %d",&a,&b)
#define sfl(t)     scanf("%lld",&t)
#define sfl2(a,b)  scanf("%lld %lld",&a,&b)
 
 
 
/*** Typedef ***/
 
typedef unsigned long long ull;
typedef long long ll;
 
 
 
/*** Some Prints ***/
 
#define en cout << '\n'
#define NO cout << "NO" << '\n'
#define no cout << "no" << '\n'
#define YES cout << "YES" << '\n'
#define yes cout << "yes" << '\n'
#define case(t) cout << "Case " << t << ": "
 
 
 
 
/*** Grids ***/
 
int drx[8]={-2,-2,-1,-1,1,1,2,2};
int dry[8]={-1,1,-2,2,-2,2,-1,1};
int dirx[4]={-1,0,1,0};
int diry[4]={0,-1,0,1};
 
 
 
/*** Loops ***/
 
#define foR0(num) for(int i=0;i<num;i++)
#define foR1(num) for(int i=1;i<=num;i++)
#define foRev(num) for(int i=num-1;i>=0;i--)
#define forIn(arr,num) for(int i=0;i<num;i++) sfi(arr[i]);
#define forIn1(arr,num) for(int i=1;i<=num;i++) sfi(arr[i]);
#define vprt(ans) for(int i=0;i<ans.size();i++) cout<< ans[i] << (i+1<ans.size() ? ' ' : '\n');
#define aprt(arr,num) for(int i=0;i<num;i++) cout<< arr[i] << (i+1<ans.size() ? ' ' : '\n');
 
 
/*** Sorts ***/
 
#define all(v) (v).begin(),(v).end()
#define rev(v) reverse(all(v))
#define srt(v) sort(all(v))
#define srtG(v) sort(all(v),greater<int>())
 
 
 
 
/*** STLs ***/
 
typedef vector <ll> vll;
typedef vector <int> vi;
typedef set <ll> sll;
typedef set <int> si;
typedef multiset <ll> msll;
typedef multiset <int> msi;
typedef stack <int> sti;
typedef stack <ll> stll;
typedef queue <ll> qll;
typedef queue <int> qi;
typedef map <ll,ll> mll;
typedef map <int,int> mii;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef vector <pll> vpll;
typedef vector <pii> vpii;
 
 
 
 
/*** Define Values ***/
 
#define PI 2*acos(0.0)
#define E 2.718281828
#define mod 1000000007
#define eps 1e-7
#define sz 100010
#define mx 200005
 
 
#define pb     push_back
#define pob    pob_back
#define puf    push_front
#define pof    pop_front
#define F      first
#define S      second
#define mp     make_pair
#define ins    insert
 
 
#define mem(v,val) memset(v,val,sizeof v)
#define add(v)     accumulate(v.begin(),v.end(), 0)
#define debug(x)   cout<<#x<<" = "<<x<<endl;
 


 
void solve()
{

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

  
}
 
 
 
 
 
int main()
{
 
  
 
  ///solve();
 
 
  int tc=1,cs=0;
  ///cin>>tc;
  while(tc--){
 
    ///cout<<"Case "<<++cs<<": ";
    solve();
 
  }
 
  return 0;
}
 
#include <bits/stdc++.h>
using namespace std;

int main() {

  int A,B,C,R;
  cin >> A >> B >> C;
  
  R = C*C - (A*A + B*B);
  
  if (R > 0){
  	cout << "Yes" << endl;
  } else {
  	cout << "No" << endl;
  }
	
}