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

#define ll long long
#define deb(x) cerr << #x << ":" << x << "\n"
#define all(x) x.begin(),x.end()

#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<int>, rb_tree_tag,tree_order_statistics_node_update>

void solve()
{
    ll a,b,c;
    cin>>a>>b>>c;
    ll M=998244353;
    a=((a*(a+1))/2)%M;
    b=((b*(b+1))/2)%M;
    c=((c*(c+1))/2)%M;
    ll ans=a;
    ans=(ans*b)%M;
    ans=(ans*c)%M;
    cout<<ans<<"\n";
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}