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 (Python):
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))

if sum(A) < H:
    print("No")
else:
    print("Yes")

Solution (Python):
h, n = map(int, input().split())
if h <= sum(list(map(int, input().split()))):
  print('Yes')
else:
  print('No')

Solution (Python):
h,n=map(int,input().split())
A=list(map(int,input().split()))

a=sum(A)

if h<=a:
  print("Yes")
else: print("No")

Solution (Python):
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

Solution (Python):
val = input().split(' ')
h = int(val[0])
n = int(val[1])
skills = [int(i) for i in input().split(' ')]

able = 'No'
for i in skills:
    h -= i
    if h <= 0:
        able = 'Yes'
        break

print(able)

Solution (Python):
H,N = map(int, input().split())
A = list(map(int, input().split()))

num = sum(A)
if num >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int,input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(H: int, N: int, A: "List[int]"):
    A.sort()
    for i in range(N):
        H-=A[-1]
        del A[-1]
        if H<=0:
            print(YES)
            break
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(H, N, A)

if __name__ == '__main__':
    main()

Solution (Python):
def resolve_b():
    h, a = map(int, input().split())
    num_list = list(map(int, input().split()))
    if sum(num_list) >= h:
        print("Yes")
    else:
        print("No")
resolve_b()

Solution (Python):
H, N = map(int, input().split())
A = list(map(int,input().split()))

if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int,input().split())
attack_max = sum(list(map(int, input().split())))

if H <= attack_max:
  print('Yes')
else:
  print('No')

Solution (Python):
N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
if sum(A)>=N:
  print("Yes")
else:
  print("No")

Solution (Python):

H , N = map(int,input().split())
A = map(int,input().split())
if H - sum(A) <= 0:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    H,N = (int(x) for x in input().split())
    a = list(map(int, input().strip().split()))
    if H - sum(a) > 0:
        print('No')
    else:
        print('Yes') 

if __name__ == '__main__':
    main()

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
b = 0
for i in a:
    b += i
print("Yes" if b >= h else "No")

Solution (Python):
h, _ = tuple(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
s = 0
for a in A:
    s+=a
    if s>=h:
        print('Yes')
        exit()
print('No')

Solution (Python):
def resolve():
    H, N = map(int, input().split())
    A = list(map(int, input().split()))
    print('Yes' if H <= sum(A) else 'No')

resolve()

Solution (Python):
H, N = map(int, input().split())
A = sorted(map(int, input().split()))
isWin = False
for i in A:
    H = H - i
    if H <= 0:
        isWin = True
        break

if (isWin):
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A_list = list(map(int, input().split()))

if sum(A_list) >= H:
  print("Yes")
else:
  print("No")

Solution (Python):
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if(sum(a)>=h):
    print("Yes")

else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A_list = list(map(int, input().split()))
sorted_A_list = sorted(A_list, reverse=True)
m_H = H
for A in sorted_A_list:
    m_H -= A
    if m_H <= 0:
        print("Yes")
        exit()
else:
    print("No")

Solution (Python):
H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if sum(a)>=h:
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = map(int, input().split())
num_list = list(map(int, input().split()))

sum_num = sum(num_list)
if sum_num >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
As = list(map(int, input().split()))
if sum(As)>=H:
  print('Yes')
else:
  print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import itertools
read = sys.stdin.buffer.read 
readline = sys.stdin.buffer.readline 
readlines = sys.stdin.buffer.readlines 

H,N = map(int, readline().split())
A = list(map(int, readline().split()))

if sum(A) >= H:
  print('Yes')
  exit()
else:
  print('No')
  exit()

Solution (Python):
x = input().split(" ")
h = int(x[0])
n = int(x[1])
a = list(map(int,input().split(" ")))

ans = h
for i in range(n):
    ans -= a[i]

if ans > 0:
    print("No")
else:
    print("Yes")

Solution (Python):
H,N = input().split()
H = int(H)
N = int(N)
A = list(map(int, input().split()))
A.sort()
while H > 0 :
    H = H - A[-1]
    del A[-1]
    if len(A) == 0:
        break
if H > 0 :
    print("No")
else :
    print("Yes")

Solution (Python):
H,N=map(int,input().split())
a = input().split()
A=[int(ai) for ai in a]

if __name__=='__main__':
    ans = 'Yes' if H - sum(A) <=0 else 'No'
    print(ans)

Solution (Python):
n=list(map(int,input().split()))
m=list(map(int,input().split()))
if(sum(m)>=n[0]):
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = map(int, input().split())
m = [i for i in input().split()]
result = 0
for i in m:
    result += int(i)

if result >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]

if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
AA=sum(A)
if H<=AA:
    print('Yes')
else:
    print('No')

Solution (Python):
H,A = map(int,input().split())
N = list(map(int,input().split()))
Attack = 0
for i in range(A):
    Attack += N[i]
if(Attack >= H):
    print("Yes")
else:
    print("No")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
a=sum(A)
if H<=a:
  print("Yes")
else:
  print("No")

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    h, n = map(int, input().split())
    a = [int(ai) for ai in input().split()]
    if sum(a) >= h:
        print('Yes')
    else:
        print('No')




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

Solution (Python):
h, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
t = sum(a)
print('Yes' if h <= t else 'No')

Solution (Python):
s = input().split()
h = int(s[0])
n = int(s[1])
s = input().split()
for i in s:
    h -= int(i)
    if h<=0:
        print('Yes')
        break
if h>0:
    print('No')

Solution (Python):
h, n = map(int, input().split())
atklist = map(int, input().split())
atk = 0
for i in atklist:
    atk += i

if atk < h:
    print('No')
else:
    print('Yes')

Solution (Python):


H,N=map(int,input().split())
A=list(map(int,input().split()))


x=0
for i in range(len(A)):
    x+=A[i]
if H>x:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys,collections,math,random,fractions,bisect;sys.setrecursionlimit(10**7)
sr = sys.stdin.readline; P = print; P2 = lambda x: print(*x, sep="\n")
def I(i=0): t = [int(x)-i for x in sr().split()];return t
def S(): t = sr().split(); return t if len(t) > 1 else t[0]
L1,L2,L3,L4, = [],[],[],[]
 
H,N = I()
A = I()
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin
lines = stdin.readlines()
 
H, N = map(int, lines[0].split())
A = sum(map(int, lines[1].split()))

if H <= A:
  print("Yes")
else:
  print("No")

Solution (Python):
h, n= map(int, input().split())
a = list(map(int, input().strip().split()))
total = sum(a) 
if(h>total):
    print('No')
else:
    print('Yes')

Solution (Python):
H, K = map(int, input().split())
A = list(map(int, input().split()))
listall=sum(A)
if listall>=H:
    print("Yes")
else:
    print("No")

Solution (Python):
B = list(input().split(" "))
h = int(B[0])
n = int(B[1])
A = list(input().split(" "))
sum = 0
for i in range(len(A)):
    sum += int(A[i])
if (h<=sum):
    print("Yes")
else:
    print("No")

Solution (Python):


h,n=map(int,input().split())
a=[int(x) for x in input().split()]
x=sum(a)
if x>=h:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))
total = 0
for i in range(n):
    total += a[i]
if total >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A_list = list(map(int, input().split()))

sum_damage = sum(A_list)

if H <= sum_damage:
    print('Yes')
else:
    print('No')

Solution (Python):
input_line = list(map(int,input().split()))

input_tec = list(map(int,input().split()))

if input_line[0] <= sum(input_tec):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
s = []
for i in range(2):
    s.append(input().split())
h = int(s[0][0])
n = int(s[0][1])
x = 0
for i in range(n):
    x = x + int(s[1][i])
if(h<=x):
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int, input().split())
li = list(map(int, input().split()))

attack = sum(li)

if attack >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))

sum=0

for i in range(n):
    sum += a[i]

if h <= sum:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
         
if sum(a) < h:
    print('No')
else:
    print('Yes')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))

a.sort()

if h<=sum(a[(-1)*n:]):
  print("Yes")
else:
  print("No")

Solution (Python):

h,n=map(int, input().split())
a=list(map(int, input().split()))
attack_point = sum(a)
if h <= attack_point:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
s = sum(A)

if s>= H:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

h,n = nm()
a = nl()
print("YNeos"[sum(a)<h::2])

Solution (Python):
h,n=[int(i) for i in input().split()]
t=[int(i) for i in input().split()]
if sum(t)>=h:print("Yes")
else:print("No")

Solution (Python):
import sys
a = input().split()  
b= input().split()
k=0
for bb in b:
  k=k+int(bb)
if int(k)>=int(a[0]):
 print("Yes")
else:
 print("No")

Solution (Python):
import math

a, b = map(int, input().split())
print('Yes' if a - sum(map(int, input().split())) <= 0 else 'No')

Solution (Python):
import sys
import numpy as np


h, n = map(int, input().split())


a = list(map(int, input().split()))

for i in a:
    h -= i

if h > 0:
    
    print("No")
else:
    
    print("Yes")

Solution (Python):
h, n = map(int, input().split())
a = sorted(list(map(int, input().split())))
if sum(a) < h:
    print('No')
else:
    print('Yes')

Solution (Python):
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
(H, N) = list(map(int,input().split()))
A  = list(map(int,input().split()))

x = sum(A)
if x < H:
    print("No")
else:
    print("Yes")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int, input().split()))
count = 0
for i in A:
    H = H - i
    
if H <=0:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))

max = 0
for i in range(n):
    max += a[i]

if max >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    H, N = [int(_) for _ in input().split()]
    A = []
    A = [int(_) for _ in input().split()]
    if H <= sum(A):
        print("Yes")
    else:
        print("No")
main()

Solution (Python):
H, N = map(int, input().split(' '))
A = map(int, input().split(' '))

A = list(A)
A.sort(reverse=True)
atk = sum(A[:N])
if atk >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
X = list(map(int, input().split()))
Y = list(map(int, input().split()))

H = X[0]
N = X[1]

A = sum(Y)

if H <= A:
  print("Yes")
else:
  print("No")

Solution (Python):
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    H, N = [int(x) for x in input().split()]
    A = [int(x) for x in input().split()]
    A.sort()
    for i in range(N):
        H -= A[N - i - 1]
    ret = "Yes" if H <= 0 else "No"
    return ret


if __name__ == "__main__":
    print(main())

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if h-sum(a[:n])<=0:
  print('Yes')
else:
  print('No')

Solution (Python):
HN = input().split()
H = int(HN[0])
N = int(HN[1])

sum = 0

A = input().split()
for i in range(N):
  sum += int(A[i])

  
if(sum >= H):
  print('Yes')
else:
  print('No')

Solution (Python):
H_N=input().split()
H=int(H_N[0])
N=int(H_N[1])
Alis=list(map(int,input().split()))

if sum(Alis)>=H:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int,input().split())
a = input().split()
for i in range(n):
    a[i] = int(a[i])


if(sum(a) >= h):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))

for i in range(N):
    H -= A[i]

if H > 0 :
    print("No")
else:
    print("Yes")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in a:
    sum += i
if sum >= h:
    print("Yes")
else:
    print("No")

Solution (Python):

H,N = map(int,input().split())
A = list(map(int,input().split()))





SUM = 0
for i in range(N):
    SUM += A[i]

if H<=SUM:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
H,N=int(a.split()[0]),int(a.split()[1])
b=input().split()
list=list(map(int, b))
if(sum(list)>=H):
  print('Yes')
else:
  print('No')

Solution (Python):
import numpy as np
N, M = map(int, input().split())
count=0
flag=True

A = list(map(int, input().split()))



X=sum(A)
if N-X<=0:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
if sum(a)>=n:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(float,input().split())
A = list(map(float,input().split()))

su = float(sum(A))


if su >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h, a = map(int, input().split())
skills_list = list(map(int, input().split()))

skills = sorted(skills_list, reverse=True)

judge = 0

for i in range(a):
  judge = judge + skills[i]

if judge >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = map(int, input().split())
A =[int(i) for i in input().split()]

if h > sum(A):
  print('No')
else:
  print('Yes')

Solution (Python):
h, n = map(int,input().split())
a = list(map(int,input().split()))
total = 0
for i in range(n):
  total += a[i]
if total >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if h <= sum(a) :
  print("Yes")
else :
  print("No")

Solution (Python):
H, N = map(int, input().split())
l = map(int, input().split())

if (sum(l)>=H):
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))

S = sum(A)

if S >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
A=list(map(int,input().split()))
if sum(A)>=h:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = [int(i) for i in input().split()]
if sum(a) >= h:
  print('Yes')
else:
  print('No')

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
num=0
for i in range(N):
  num=num+A[i]
if num>=H:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))


if(sum(a) >= h):
    print('Yes')
else:
    print('No')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
s = sum(a)
if s < h:
  print('No')
else:
  print('Yes')

Solution (Python):
h,n=map(int,input().split())
a=[int(i) for i in input().split()]
print("Yes" if sum(a)>=h else "No")

Solution (Python):
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

Solution (Python):
[H, N] = [int(x) for x in input().split()]
A = list(map(int, input().split()))
count = 0
for x in A:
    count += x
print("Yes" if count >= H else "No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
a = 0
for i in A:
        a+=i
if a>=H:
        print("Yes")
else:
        print("No")

Solution (Python):
h,n = map(int,input().split())
p = list(map(int,input().split()))
a = 0
for i in p:
  a += i
if a >= h:
  print('Yes')
else:
  print('No')

Solution (Python):
h, n = map(int, input().strip().split())
a = list(map(int, input().strip().split()))

if h<=sum(a):
    print("Yes")
else:
    print("No")

Solution (Python):
H, _ = map(int, input().split())
if sum(map(int, input().split())) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
h, a = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if h <= sum(a):
  print("Yes")
else:
  print("No")

Solution (Python):
h, n = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))

if sum(a) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
a=input().split()
a=list(map(int,a))
a.sort(reverse=True)
flag=0
ans=0
for i in range(n):
    ans+=a[i]
    if ans>=h:
        flag=1
        break
if flag==1:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = [int(n) for n in input().split()]

A = [int(n) for n in input().split()]

if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = [int(a) for a in input().split()]
Asum = sum(A)
if Asum >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
i=list(map(int,input().split()))
j=list(map(int,input().split()))
h=i[0]
a=True
c=0
j.sort(reverse=True)
for b in j:
  c+=b
  if c>=h:
    print("Yes")
    a=False
    break
if a:
  print("No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
A=0
for i in range(n):
    A+=a[i]
if A>=h:
    print('Yes')
else:
    print('No')

Solution (Python):
x,y=map(int,input().split())
a=input().split()
k=[]
for i in a:
    k.append(int(i))
if x-sum(k)<=0:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int,input().split())

a = list(map(int,input().split()))

A = sum(a)

if h - A > 0:
  print("No")
else:
  print("Yes")

Solution (Python):
hn = list(map(int, input().split()))
h = hn[0]
n = hn[1]
a = list(map(int, input().split()))

s = sum(a)

if s >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))

if H <= sum(A): print('Yes')
else: print('No')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
tempsum=sum(A)
if H>tempsum:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys
import math

h,n = list(map(int,input().split()))
li = list(map(int,input().split()))

if (sum(li) >= h):
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())

list = list(map(int,list(input().split())))

if sum(list) >= H:
  print('Yes')
else:
  print('No')

Solution (Python):

H, N = map(int, input().split())
A = list(map(int, input().split()))

if H>sum(A):
    print("No")
else:
    print("Yes")

Solution (Python):
def acinput():
    return list(map(int, input().split(" ")))

H,N=acinput()
A=acinput()

if H>sum(A):
    print("No")
else:
    print("Yes")

Solution (Python):
def  spe(H,A):
    att_sum = sum(A) 
    if H -att_sum>0:
        print("No")
    else:
        print("Yes")
        



inp = input().split()
inp_ = input().split()
H = int(inp[0])
N = int(inp[1] )
A= [int(i) for i in inp_]
spe(H,A)

Solution (Python):
h, _ = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if h <= sum(a):
    print("Yes")
else:
    print("No")

Solution (Python):
c = list(map(int,input().split()))
a = list(map(int,input().split()))

a.sort(reverse=True)

flag = 0
damage = 0
for i in range(c[1]):
  damage += a[i]
  if damage >= c[0]:
    flag = 1
    break

if flag == 1:
  print("Yes")
else:
  print("No")

Solution (Python):



test = ""

"""
10 3
4 5 6
ans Yes
"""

"""
20 3
4 5 6
ans No
"""

"""
210 5
31 41 59 26 53
ansYes
"""

"""
211 5
31 41 59 26 53
ans No
"""

test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()


h, n = map(int, input2().split())
a = list(map(int, input2().split()))

suma = sum(a)

if h > suma:
    print("No")
else:
    print("Yes")

Solution (Python):
h,n = map(int,input().split())
li = list(map(int,input().split()))
if sum(li) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))





a.sort(reverse=True)


win = 0

for i in range(n) :
    h = h - a[i]
    if h <= 0 :
        win=1
        break

if win :
    print("Yes")
else :
    print("No")

Solution (Python):
H,N=(int(x) for x in input().split())
A=list(map(int, input().split()))
B=sum(A)
if B >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = [int(i) for i in input().split()]
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(B) >= A[0]:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n = map(int,input().split(" "))
a=[int(i) for i in input().split(" ")]

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if h <= sum(a):
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int,input().split())
a_list = list(map(int,input().split()))
if sum(a_list) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):


h, n = map(int, input().split())
alist = list(map(int, input().split()))
total = sum(alist)
if total >= h:
  print('Yes')
else:
  print('No')

Solution (Python):
a = input()
a = a.split(" ")
b = input()
b = b.split(" ")
c = 0
for b_num in b:
  c = c + int(b_num)
  
if int(a[0]) <= c:
  print("Yes")
else:
  print("No")

Solution (Python):
H,N = map(int,input().split())
hairetu = list(map(int,input().split()))


goukei = sum(hairetu)

if goukei>=H:
  print('Yes')
else:
  print('No')

Solution (Python):
H,A = list(map(int, input().split()))
A = list(map(int,input().split()))
S = sum(A)
if S < H:
    print('No')
else:
    print('Yes')

Solution (Python):
h, n = list(map(int, input().split()))
lst = list(map(int, input().split()))
sum = 0
for _ in range(n):
  sum += lst[_]
if sum >= h:
  print('Yes')
else:
  print('No')

Solution (Python):




"""
このプログラムはPythonを書く際のテンプレとなっています。これをコピペしてコーディングを行なってください。
なお字下げしないこと！！
"""

__author_ = 'Maruta Yuzuha'
__version_ = '1.0.0'
__date__ = '2019/12/25'

def main():
    """
    ここでプログラムの解説を行う
     >>main()
    Hello world.
    0
    """
    s = input().split()
    t = input().split()
    a = 0
    for i in range(int(s[1])):
        a += int(t[i])
    b = int(s[0])
    if b <= a:
        print('Yes')
    else:
        print('No')

    return 0

if __name__ == '__main__':
    
    

    
    
    import doctest
    doctest.testmod()

    
    import sys
    sys.exit(main())

Solution (Python):

h,n = map(int, input().split())

a = [int(x) for x in input().split()]
aa = 0
for i in a:
    aa = aa + i

if h > aa:
    print("No")
else:
    print("Yes")

Solution (Python):
H, A = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
for x in A:
    H -= x
print("Yes" if H <= 0 else "No")

Solution (Python):
def main():
    h, n = list(map(int, input().split()))
    a = list(map(int, input().split()))

    if sum(a) >= h:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
H, N = map(int, input().split())
i = list(map(int, input().split()))
a=0

for k in range(N):
    a+=i[k]

if H>a:
    print("No")
else:
    print("Yes")

Solution (Python):
H, N = map(int, input().split())
A_list_ = input().split()
A_list = [int(s) for s in A_list_]


sorted_A_list = sorted(A_list, reverse=True)

if sum(sorted_A_list[0:N])>=H:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))

if H-sum(A)>0:
    print("No")
else:
    print("Yes")

Solution (Python):
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

Solution (Python):
h,n = map(int,input().split())
a = sorted(list(map(int,input().split())),reverse=True)
ans = 0
summ = 0
for i in range(len(a)):
    summ += a[i]
    if summ >= h:
        ans = 1
        break
if ans == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
import numpy as np
H, N = map(int, input().split())
As = [int(x) for x in input().split()]
if H - np.sum(As) <= 0:
  print('Yes')
else:
  print('No')

Solution (Python):
import math

H, N = map(int, input().split(' '))
A = list(map(int, input().split(' ')))


def main():
    if sum(A) < H:
        return 'No'
    else:
        return 'Yes'


ans = main()

print(ans)

Solution (Python):
hp, n = map(int, input().split())
b = list(map(int, input().split()))

b.sort(reverse=True)

i = 0

while n > 0:
    hp = hp - b[i]
    i += 1
    n -= 1

if hp < 1:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

sum_a = 0
for i in range(N):
    sum_a += A[i]

if H <= sum_a:
  print('Yes')
else:
  print('No')

Solution (Python):
H,N=map(int,input().split())
A=map(int,input().split())

if sum(A)<H:
    print('No')
else:
    print('Yes')

Solution (Python):
input1 = input().split()
HP = int(input1[0])

input2 = input().split()
ATK = sum(list(map(int,input2)))

if HP <= ATK:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
if H<=sum(A) : print("Yes")
else : print("No")

Solution (Python):
h,n=map(int,input().split())
l=list(map(int,input().split()))
a=sum(l)
if a<h:
    print('No')
else:
    print('Yes')