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 Rust (1.15.1) (judge verdict: Accepted)

fn main() {
    let r = std::io::stdin();
    let mut sc = Scanner::new(r.lock());
    let v = sc.read_line();

    let mut h : i32 = v[0].parse().unwrap();
    let n : usize = v[1].parse().unwrap();

    let v = sc.read_line();

    for i in 0..n {
        let a : i32 = v[i].parse().unwrap();
        h -= a;
    }

    if h <= 0 {
        println!("Yes");
    } else {
        println!("No");
    }
}

pub struct Scanner<R: std::io::Read> (std::io::BufReader<R>);

impl<R: std::io::Read> Scanner<R> {
    pub fn new(r: R) -> Scanner<R> {
        Scanner (std::io::BufReader::new(r))
    }

    pub fn read_line(&mut self) -> Vec<String> {
        use std::io::BufRead;
        let mut line = String::new();
        self.0
            .read_line(&mut line)
            .unwrap();

        line.split_whitespace()
            .map(|b| b.to_string())
            .collect::<Vec<String>>()
    }
}