#include <bits/stdc++.h>
using namespace std;
 
typedef long double ld;
const long long inf = 1100000000000000000;
#define maxn 1000005
#define mod 1000000007 //998244353 
#define int long long 
#define PB push_back
#define F first
#define S second
#define vi vector<int>
#define rep(i,a,b)  for( int i = a; i < b; i++ )
#define rep1(i,a,b) for( int i = a; i <= b; i++)
#define repd(i,a,b) for( int i = a; i >= b; --i)
#define sz(x) (int)((x).size())  
#define all(c) (c).begin(),(c).end()
#define allr(v) v.rbegin(),v.rend()
#define mem(a,x) memset(a,x,sizeof(a))
#define dbg(a) cout << #a << " is " << (a); cout << "\n";

//...
int a, b, c;
bool ck(){
	return a*a + b*b < c*c;
}
void solve(){
	cin>>a>>b>>c;
	if(ck())
		cout<<"Yes";
	else	
		cout<<"No";
}

signed main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int T=1; //cin>>T; 
    while(T--){
        solve(); cout<<'\n';
    }
    return 0;
}
/*input
10 3

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(double i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define MP make_pair
ll mult(ll a,ll b){
    ll res=0LL;
    while(b){
        if(b&1) res=(res+a)%MOD;
        a=(a+a)%MOD;
        b>>=1;
    }
    return res%MOD;
}
ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        b>>=1;
    }
    return res;
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int a,b;
    cin>>a>>b;
    cout<<(a/b);
}