Problem:
Score : 200 points

Problem 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.

Constraints

1 \leq H \leq 10^9

1 \leq N \leq 10^5

1 \leq A_i \leq 10^4

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H N
A_1 A_2 ... A_N

Output

If Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.

Sample Input 1

10 3
4 5 6

Sample Output 1

Yes

The monster's health will become 0 or below after, for example, using the second and third moves.

Sample Input 2

20 3
4 5 6

Sample Output 2

No

Sample Input 3

210 5
31 41 59 26 53

Sample Output 3

Yes

Sample Input 4

211 5
31 41 59 26 53

Sample Output 4

No

Solution in JavaScript (node.js v5.12) (judge verdict: Accepted)

"use strict";

function Main(input) {
  let lines = input.trim().split("\n");
  let monstarInfo = lines[0].split(" ").map(x => x - 0);
  let monsterPower = monstarInfo[0];
  let attackNum = monstarInfo[1];
  let araInfo = lines[1].split(" ").map(x => x - 0).sort().reverse();
  let ans = "No";
  let sum = 0;
  for(let i = 0; i < attackNum; i++){
    sum += araInfo[i];
   	if( sum  >= monsterPower){
      ans = 'Yes';
      break;
  	}
  }
  console.log(ans);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));