output_description: If it is possible to construct a Haiku by using each of the phrases once,
  print `YES` (case-sensitive). Otherwise, print `NO`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: #!/usr/bin/env python3
  from collections import defaultdict
  from collections import deque
  from heapq import heappush, heappop
  import sys
  import math
  import bisect
  import random
  import itertools
  sys.setrecursionlimit(10**5)
  stdin = sys.stdin
  bisect_left = bisect.bisect_left
  bisect_right = bisect.bisect_right
  def LI(): return list(map(int, stdin.readline().split()))
  def LF(): return list(map(float, stdin.readline().split()))
  def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
  def II(): return int(stdin.readline())
  def IF(): return float(stdin.readline())
  def LS(): return list(map(list, stdin.readline().split()))
  def S(): return list(stdin.readline().rstrip())
  def IR(n): return [II() for _ in range(n)]
  def LIR(n): return [LI() for _ in range(n)]
  def FR(n): return [IF() for _ in range(n)]
  def LFR(n): return [LI() for _ in range(n)]
  def LIR_(n): return [LI_() for _ in range(n)]
  def SR(n): return [S() for _ in range(n)]
  def LSR(n): return [LS() for _ in range(n)]
  mod = 1000000007
  inf = float('INF')
  
  #A
  def A():
      a = LI()
      a.sort()
      if a = [5, 5, 7]:
          print("YES")
      else:
  
          print("NO")
      return
  
  #B
  def B():
      return
  
  #C
  def C():
      return
  
  #D
  def D():
      return
  
  #E
  def E():
      return
  
  #F
  def F():
      return
  
  #G
  def G():
      return
  
  #H
  def H():
      return
  
  #Solve
  if __name__ == '__main__':
      A()
  
problem_description: Statement
  
  Iroha loves _Haiku_. Haiku is a short form of Japanese poetry. A Haiku
  consists of three phrases with 5, 7 and 5 syllables, in this order.
  
  To create a Haiku, Iroha has come up with three different phrases. These
  phrases have A, B and C syllables, respectively. Determine whether she can
  construct a Haiku by using each of the phrases once, in some order.
samples: [{"input": "5 5 7", "output": "YES\n    \n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\n* * *"}, {"input": "7 7 5", "output": "NO"}]