#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define MOD 1000000007
#define vec vector<int>
#define vecll vector<ll>
#define pb push_back
#define f(i,l,n) for(int i=l;i<n;i++)
#define fll(i,l,n) for(ll i=l;i<n;i++)
#define regstuff                \
    int n;                      \
    cin >> n;                   \
    vec A(n);                   \
    for (int i = 0; i < n; i++) \
        cin >> A[i];
#define fast                          \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);
vec noprimes(1000001);

void seive(vec &primes, int n)
{
   //gives a prifix array of number of primes as well
    vector<bool> ntprimes(n + 1, false);
    ntprimes[0] = ntprimes[1] = true;
    for (int i = 2; i * i <= n; i++)
    {
        if (!ntprimes[i])
        {
            for (int j = i * i; j <= n; j += i)
            {
                ntprimes[j] = true;
            }
        }
    }
    int x = 0;
    for (int i = 2; i <= n; i++)
    {
        if (!ntprimes[i])
        {
            primes.pb(i);
            x++;
            noprimes[i] = x;
        }
        else
            noprimes[i] = x;
    }
}

ll pow(ll x, ll n)
{
    ll res = 1;
    while (n)
    {
        if (n % 2 == 0)
        {
            n = n / 2;
            x = x * x;
        }
        else
        {
            res *= x;
            n--;
        }
    }
    return res;
}

int main()
{
    fast 
    int 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>

using namespace std;

#ifdef LOCAL
    #include "dbg.cpp"
#else
    #define out(...) 42
#endif

void solve () {
    int64_t a, b, c;
    cin >> a >> b>> c;
    a *= a;
    b *= b;
    c *= c;
    if (a + b < c) cout <<"Yes\n";
    else            cout<<"No\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int tc = 1;
    // cin >> tc;

    for (int i = 1; i <= tc; ++i) 
        solve ();
}