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 = map(int, input().split())
L= list(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()))
print('Yes' if sum(a)>=h 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()))
print('Yes' if H <= sum(A) else 'No')

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

Solution (Python):
enemy,skill=map(int,input().split())
damage=map(int,input().split())
if(enemy-sum(damage)<=0):
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
h,n = map(int, input().split())
a = [int(_) for _ in input().split()]
print('YNeos'[h>sum(a)::2])

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

answer = 'Yes' if H - sum(A) <= 0 else 'No'

print(answer);

Solution (Python):



if False:
    N,K=map(int,input().split())
    H=[int(i) for i in input().split()]
    H.sort(reverse=True)
    print(sum(H[K:]))


if False:
    H=int(input())
    cnt=1
    ans=0
    while H>1:
        ans+=cnt
        H//=2
        cnt*=2
    print(ans+cnt)


if False:
    
    def ceil(a,b): 
        return (a+b-1)//b

    H,A=map(int,input().split())
    print(ceil(H,A))


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())
Total = sum(map(int,input().split()))

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) <= 0:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    h,n=INTM()
    a=LIST()
    if sum(a)>=h:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

Solution (Python):
x,y  = map(int, input().split())
li = list(map(int,input().split()))
s=0
for i in range(len(li)):
    s+=li[i]
if s>=x:
    print('Yes')
else:
    print('No')

Solution (Python):
p,q= input().split()
a,b =(int(p), int(q))
s = input().split()
total = 0
for i in range(b):
    total += int(s[i])
if total >= a:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
def main():
    hp, num = map(int, input().split())
    a = list(map(int, input().split()))
    attack = sum(a)

    if hp > attack:
        print("No")
    else:
        print("Yes")

if __name__ == "__main__":
    main()

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):

from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
H,N = inputlist()
A = inputlist()
s = sum(A)
if H <= s:
    print("Yes")
else:
    print("No")

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

    have=list(map(int,input().split()))
    cal=0

    for i in have:
        cal+=i
        if cal>=H:
            print("Yes")
            return

    print("No")
    return


main()

Solution (Python):
h, n = map(int, input().split())
if sum(list(map(int, input().split()))) >= h:
    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")
if sum(A)<h:
    print("No")

Solution (Python):

HN = input().split(' ')
H = int(HN[0])
N = int(HN[1])
Ai = input().split(' ')
power = 0
for s in range(N):
    power += int(Ai[s])
if power >= 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()))
if sum(a)<h:
    print("No")
else:print("Yes")

Solution (Python):
def q2():
    H,N = (int(i) for i in input().split())
    A = [int(i) for i in input().split()]
    if sum(A) >= H:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    q2()

Solution (Python):
h, a = 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 h > sum(a):
    print('No')
else:
    print('Yes')

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

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

if sum(aL) >= h:
    print("Yes")
    exit()
print("No")

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

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

Solution (Python):
H,N=map(int,input().split());A=sum(map(int,input().split()));print('YNeos'[H>A::2])

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,A=input().split()
H=int(H)
A=int(A)
l=input().split()
l=[int(i) for i in l]
S=sum(l)
if H<=S:
    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 = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
print("Yes" if sum(a) >= h else "No")

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

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

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

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
a=sorted(a,reverse=True)
x=0
for i in range(n):
    x+=a[i]
if x>=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())
sum_a = sum(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()))

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(H: int, N: int, A: "List[int]"):
    print(YES if sum(A) >= H else 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):
H, N = map(int, input().split())
A = map(int, input().split())

winner = False
if H <= sum(A):
    winner = True

if winner:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
if H>sum(ls):
  print('No')
else:
  print('Yes')

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

sum=0
for i in x:
  sum=sum+i

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

Solution (Python):
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):
HN=list(map(int,input().strip().split()))
H=HN[0]
N=HN[1]
A=list(map(int,input().strip().split()))

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

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

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

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

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

if N[0]>sum(A):
  print('No')
else:
  print('Yes')

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

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

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

Solution (Python):

import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

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

if __name__ == '__main__':
    main()

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
sum=0
i=0
while i<=N-1:
  sum+=A[i]
  i+=1
if sum>=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=h-a[i]
  if h<=0:
    print("Yes")
    exit()
print("No")

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

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
print("Yes" if H <= sum(A) 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):
def main():
    h, n = map(int, input().split())
    a = list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    H, M = map(int, input().split())
    A = list(map(int, input().split()))
    A = sum(A)
    if H - A > 0:
        print("No")
    else:
        print("Yes")


main()

Solution (Python):
import numpy as np

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

if ene[0]>np.array(num).sum():
    print("No")
else:
    print("Yes")

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

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):
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 = map(int, input().split())
print('Yes' if h <= sum(int(i) for i in input().split()) else 'No')

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

Solution (Python):
HN= input().split()
H= int(HN[0])
N= int(HN[1])
move=input().split()
dam=0
flag=False
for i in range (N):
    dam= dam+int(move[i])
    if (dam>=H):
        flag=True
        break
    else:
        flag=False
    
if (flag==True):
    print("Yes")
else:
    print("No")

Solution (Python):
readline = input().split()
attacks = input().split()
hp = int(readline[0])
attacksum = 0
for i in range (len(attacks)):
    attacksum += int(attacks[i])

if (attacksum >= hp):
    print('Yes')
else:
    print('No')

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

x=0

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

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

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

Solution (Python):
import sys

x = sys.stdin.readline()
x = x.split(' ')
(h,n)=[int(str) for str in x]
x = sys.stdin.readline()
x = x.split(' ')

sum = 0
for i in x:
  sum += int(i)

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

sys.stdout.flush()

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

tmp = list(input().split())
sum = 0

for i in range (N) :
    sum += int(tmp[i])

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

Solution (Python):
h, n = list (map (int, input ().split ()))
a = list (map (int, input ().split ()))
print ("Yes" if sum (a) >= h 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()))
a = sum(A)
print("Yes" if a >= H else "No")

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

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
for i in A:
    H -= i
    if H < 1:
        print('Yes')
        exit()
print('No')

Solution (Python):
h, n = map(int, input().split())
li = list(map(int, input().split()))
for i in li:
  h -= i
  
if h <= 0:
  print("Yes")
else:
  print("No")

Solution (Python):

H,N = (int(x) for x in 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()))
a_sum = sum(A)

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

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


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

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

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

Solution (Python):
import numpy as np


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

if H - A.sum() <= 0:
    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):
hp, attack_count = map(int, input().split())
attack_list = list(map(int, input().split()))
full_damage = sum(attack_list)

if hp > full_damage:
    print("No")
else:
    print("Yes")

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

sum = 0
for i in range(n):
	sum = sum + a[i]
if sum >= h :
	print("Yes")
else:
	print("No")

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

Solution (Python):
h,n=map(int,input().split())
print("Yes"if sum(list(map(int,input().split())))>=h 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())
l = list(map(int, input().split()))
if sum(l) - h >= 0:
    print("Yes")
else:
    print("No")

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

for i in range(n):
    h -= li[i]
    
if h <= 0:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
x = [int(x) for x in input().split()]
line = [int(x) for x in input().split()]

if sum(line) >= x[0]:
  	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()))

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

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

total = sum(A)

print("Yes" if total >= H else "No")

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

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

Solution (Python):
def s0():
    a=input().split()
    (n,m)=map(int,a)
    b=input().split()
    b1=list(map(int,b))
    d=sum(b1)
    if d>=n:
        return 'Yes'
    else:
        return 'No'


print(s0())

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

if h > sum(c):
    print("No")
elif h <= sum(c):
    print("Yes")

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 = sum(map(int, input().split()))
print('Yes' if h <= A else 'No')

Solution (Python):
hn = input().split()
aa = input().split()

h = int(hn[0])

for i in range(len(aa)):
	h = h - int(aa[i])

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

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

attack=0
for i in range(len(a)):
  attack=attack+a[i]

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

Solution (Python):
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College
    Date:23/03/2020
'''


from math import ceil
def main():
    
    
    
    n,m=map(int,input().split())
    
    a=list(map(int,input().split()))
    s=sum(a)
    if(n<=s):
        print('Yes')
    else:
        print('No')
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ =="__main__":
    main()

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

if H <= sum(A):
    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()))
print("Yes") if h <= sum(a) 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):
hn=input().rstrip().split(" ")
h=int(hn[0])
n=int(hn[1])
skills=input().rstrip().split(" ")
sums=0
for skill in skills:
    sums=sums+int(skill)
if h<=sums:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = sum(list(map(int, input().split())))
print("Yes") if h<=a 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()))
if sum(A) >= h:
  print("Yes")
else:
  print("No")

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

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

at=sum(a)

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

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

Solution (Python):
H,N,*A=map(int,open(0).read().split())
print("Yes" if sum(A)>=H else "No")

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

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

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

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

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


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

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

if MAX < H:
  print("No")
else:
  print("Yes")

Solution (Python):
data = input().split()
h = int(data[0])
n = int(data[1])

waza = input().split()
damage = 0

for i in range(n):
  damage += int(waza[i])

if damage >= h:
  ans = "Yes"
else:
  ans = "No"

print(ans)

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 h <= sum(a):
    print('Yes')

else:
    print('No')

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

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

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

Solution (Python):

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

print('Yes' if sum(a) >= h 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):
A,B = map(int,input().split())
num = list(map(int,input().split()))

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

Solution (Python):
h, n = [int(elem) for elem in input().split()]
a_lst = [int(elem) for elem in input().split()]

if h <= sum(a_lst):
  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 = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += a[i]

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

Solution (Python):
h,n=map(int,input().split())
a=sorted(list(map(int,input().split())),reverse=True)
x=len(a)

if x<=n:
    if sum(a)>=h:
        print('Yes')
    else:
        print('No')
else:
    a=a[:x-n+1]
    if sum(a)>=h:
        print('Yes')
    else:
        print('No')

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

Solution (Python):



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


a_sum = sum(a_list)


if h - a_sum<=0:
    print("Yes")
else:
    print("No")

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

x=sum(a)
print('Yes' if h<=x else '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()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

import sys
argVec = sys.argv
if len(argVec) > 1:
    GBN_DEBUG = True
else:
    GBN_DEBUG = False

def dprn(s, i):
    if GBN_DEBUG:
        print(", " + s + " = " + str(i), end = "")

def dprns(s):
    if GBN_DEBUG:
        print(", " + s, end = "")

def dprni(i):
    if GBN_DEBUG:
        print(str(i), end=" ")




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 h - sum(a) <= 0:
    print("Yes")
else:
    print("No")

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

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 = [int(x) for x in input().split()]

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

Solution (Python):
import sys
input = sys.stdin.readline
H, N = map(int, input().split())
sm = sum(list(map(int, input().split())))
if H <= sm: 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):
a,b = map(int, input().split())
h = list(map(int,input().split()))
print("Yes" if sum(h) >= a 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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

h, n = MAP()
a = LIST()
if sum(a) >= h:
    print('Yes')
else:
    print('No')

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


if __name__ == '__main__':
    main()

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

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()))
for k in range(0,n):
  h=h-a[k]
if h>0:
  print("No")
else:
  print("Yes")

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

Solution (Python):
a,s=map(int,input().split())
print("Yes") if  sum(list(map(int,input().split())))>=a 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('Yes')
else:
  print('No')

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

Solution (Python):
H,N = map(int,input().split())
A = [int(i) for i in input().split()]
j = 0
for a in A:
  j += a
if j >= 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 = list(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 = map(int, input().split())
sumA = sum(A)

if H - sumA <= 0:
  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("No")
else:
    print("Yes")

Solution (Python):
h, n = map(int, input().split())
a_list = list(map(int, input().split()))
for i in a_list:
    h = h - i
if h <= 0:
    print("Yes")
else:
    print("No")

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

count = 0
for num in a_list:
  count += num

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

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

Solution (Python):
h, n = map(int, input().split())
Deathblow = list(map(int, input().split()))
for i in range(n):
  h -= Deathblow[i]
if h < 1:
  print("Yes")
else:
  print("No")

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

if result <= 0:
    print("Yes")
else:
    print("No")

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

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

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

if H <= sum(A):
    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 = input('').split(' ')
A = [int(i) for i in A]
if(sum(A) < H):
    print('No')
else:
    print('Yes')