output_description: If Raccoon can win without using the same move twice or more, print `Yes`;
  otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H N
      A_1 A_2 ... A_N
attempt: H, N = [int(x) for x in input().strip().split()]
  print("YNeos"[sum([int(x) for x in input().split()]) < H :: 2])
  
problem_description: Statement
  
  Raccoon is fighting with a monster.
  
  The _health_ of the monster is H.
  
  Raccoon can use N kinds of special moves. Using the i-th move decreases the
  monster's health by A_i. There is no other way to decrease the monster's
  health.
  
  Raccoon wins when the monster's health becomes 0 or below.
  
  If Raccoon can win without using the same move twice or more, print `Yes`;
  otherwise, print `No`.
samples: [{"input": "10 3\n    4 5 6", "output": "Yes\n    \n\nThe monster's health will become 0 or below after, for example, using the\nsecond and third moves.\n\n* * *"}, {"input": "20 3\n    4 5 6", "output": "No\n    \n\n* * *"}, {"input": "210 5\n    31 41 59 26 53", "output": "Yes\n    \n\n* * *"}, {"input": "211 5\n    31 41 59 26 53", "output": "No"}]