#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
  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 <ctime>
#include <deque>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <regex>
#include <set>
#include <bitset>

const int64_t infl = 1LL << 60;
const int64_t cc = pow(10, 9) + 7;
bool sort_pair(std::pair<int64_t, std::string> origin, std::pair<int64_t, std::string> another){return origin.first > another.first;}
template <typename T> bool chmin(T &a, const T& b) {if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b) {if(a < b) {a = b;return true;}return false;}
std::vector<std::string> list;

int main()
{
    //std::vector< std::pair< int64_t, int64_t > > list;
    std::vector< std::string > str_list;
    std::string str1;
    std::string str2;
    int64_t n,k,l,a,b,c;
    std::cin>> a;
    std::cin>> b;
    std::cin>> c;

    if( pow( a, 2 ) + pow( b, 2 ) < pow( c, 2 ) )
    {
        std::cout<< "Yes";
    }
    else
    {
        std::cout<< "No";
    }
}

