output_description: If \sqrt{a} + \sqrt{b} < \sqrt{c}, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a \ b \ c
attempt: import math
  import fractions
  import bisect
  import collections
  import itertools
  import heapq
  import string
  import sys
  import copy
  from decimal import *
  from collections import deque
  
  sys.setrecursionlimit(10**7)
  MOD = 10**9 + 7
  INF = float("inf")  # 無限大
  
  
  def gcd(a, b):
      return fractions.gcd(a, b)  # 最大公約数
  
  
  def lcm(a, b):
      return (a * b) // fractions.gcd(a, b)  # 最小公倍数
  
  
  def iin():
      return int(sys.stdin.readline())  # 整数読み込み
  
  
  def ifn():
      return float(sys.stdin.readline())  # 浮動小数点読み込み
  
  
  def isn():
      return sys.stdin.readline().split()  # 文字列読み込み
  
  
  def imn():
      return map(int, sys.stdin.readline().split())  # 整数map取得
  
  
  def imnn():
      return map(lambda x: int(x) - 1, sys.stdin.readline().split())  # 整数-1map取得
  
  
  def fmn():
      return map(float, sys.stdin.readline().split())  # 浮動小数点map取得
  
  
  def iln():
      return list(map(int, sys.stdin.readline().split()))  # 整数リスト取得
  
  
  def iln_s():
      return sorted(iln())  # 昇順の整数リスト取得
  
  
  def iln_r():
      return sorted(iln(), reverse=True)  # 降順の整数リスト取得
  
  
  def fln():
      return list(map(float, sys.stdin.readline().split()))  # 浮動小数点リスト取得
  
  
  def join(l, s=""):
      return s.join(l)  # リストを文字列に変換
  
  
  def perm(l, n):
      return itertools.permutations(l, n)  # 順列取得
  
  
  def perm_count(n, r):
      return math.factorial(n) // math.factorial(n - r)  # 順列の総数
  
  
  def comb(l, n):
      return itertools.combinations(l, n)  # 組み合わせ取得
  
  
  def comb_count(n, r):
      return math.factorial(n) // (
          math.factorial(n - r) * math.factorial(r)
      )  # 組み合わせの総数
  
  
  def two_distance(a, b, c, d):
      return ((c - a) ** 2 + (d - b) ** 2) ** 0.5  # 2点間の距離
  
  
  def m_add(a, b):
      return (a + b) % MOD
  
  
  def sieves_of_e(n):
      is_prime = [True] * (n + 1)
      is_prime[0] = False
      is_prime[1] = False
      for i in range(2, int(n**0.5) + 1):
          if not is_prime[i]:
              continue
          for j in range(i * 2, n + 1, i):
              is_prime[j] = False
      return is_prime
  
  
  a, b, c = imn()
  ma = Decimal(str(math.sqrt(a)))
  mb = Decimal(str(math.sqrt(b)))
  mc = Decimal(str(math.sqrt(c)))
  
  da = Decimal(str(a))
  db = Decimal(str(b))
  dc = Decimal(str(c))
  if da.sqrt() + db.sqrt() < dc.sqrt():
      print("Yes")
  else:
      print("No")
  
problem_description: Statement
  
  Does \sqrt{a} + \sqrt{b} < \sqrt{c} hold?
samples: [{"input": "2 3 9", "output": "No\n    \n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\n* * *"}, {"input": "2 3 10", "output": "Yes\n    \n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds."}]