#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
using VV = vector<V>;
using SV = vector<string>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1e18
const double PI = acos(-1);
const int dx[] = { -1,0,1,0 }; const int dy[] = { 0,-1,0,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

void solve_abc_a() {
	ll l_ans = 0;
	string s_ans;
	double d_ans = 0;

	ll n, m;
	ll x, y;
	ll h, w;
	ll a, b;
	ll c;
	//char c;
	//ll d;
	char yc, ac;
	ll k;
	string s, t;
	//ll s, t;
	ll q, r;

	cin >> a >> b >> c;

	if (a * a + b * b < c * c) {
		cout << "Yes\n";
	}
	else {
		cout << "No\n";
	}

	//cout << l_ans << "\n";
	//cout << s_ans << "\n";
	//cout << d_ans << "\n";
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed;
	cout << setprecision(12);

	solve_abc_a();

	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if((a*a)+(b*b)<(c*c)){
	    cout<<"Yes"<<endl;
	}
	    else
	    cout<<"No";
	return 0;
}