Description
Problem Statement
Raccoon is fighting against 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 Ai.
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.
Constraints
• 1≤H≤1000 000 000
• 1≤N≤100 000 • 1≤Ai≤10 000
• All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A1 A2 ...... AN
Output
If Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.