{"raw_statement":[{"iden":"problem statement","content":"Raccoon is fighting with a monster.\nThe _health_ of the monster is $H$.\nRaccoon 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.\nRaccoon wins when the monster's health becomes $0$ or below.\nIf Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`."},{"iden":"constraints","content":"*   $1 \\leq H \\leq 10^9$\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^4$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$ $N$\n$A_1$ $A_2$ $...$ $A_N$"},{"iden":"sample input 1","content":"10 3\n4 5 6"},{"iden":"sample output 1","content":"Yes\n\nThe monster's health will become $0$ or below after, for example, using the second and third moves."},{"iden":"sample input 2","content":"20 3\n4 5 6"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"210 5\n31 41 59 26 53"},{"iden":"sample output 3","content":"Yes"},{"iden":"sample input 4","content":"211 5\n31 41 59 26 53"},{"iden":"sample output 4","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}