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):
hs= input().split()
h = int(hs[0])
s = int(hs[1])
skill = input().split()
total_skill = 0
for i in range(s):
  total_skill = total_skill + int(skill[i])
if(h <= total_skill):
  print("Yes")
else:
  print("No")

Solution (Python):
import math

a,b = map(int, input().split())
l = input().split()
sum = 0
for i in range(b):
  sum = sum + int(l[i])
if a > sum:
  print('No')
else:
  print('Yes')

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

tmp = sum(A)
tmp = H-tmp

if tmp <=0:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Solution (Python):

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

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

for i in range(n):
  a-=p[i]
if a<=0:
  print('Yes')
else:
  print('No')

Solution (Python):
H, N = input().split()
H = int(H)
N = int(N)
A= input().split()
total=0
for i in A:
    total += int(i)
if total >= H:
    print("Yes")
elif total < H:
    print("No")

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

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

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

print(ans)

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

Solution (Python):
H,N =(float(x) for x in input().split())
list1 = [float(s) for s in input().split()] 

i=0
Sum=0
while i<N:
 Sum=Sum+list1[i]
 i=i+1

if Sum<H:
  print("No")

else:
  print("Yes")

Solution (Python):
x, y = list(map(int, input().strip().split(' ')))
a = list(map(int, input().strip().split(' ')))
class health:
  def __init__(self, x, y, a):
    self.x = x
    self.y = y
    self.a = a
  def decrease_health(self, i):
    self.x = self.x-self.a[i]
monster = health(x, y, a)
for i in range(len(a)):
  monster.decrease_health(i)
if(monster.x <= 0): print('Yes')
else: print('No')

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

s=0

for i in range(N):
    s+=A[i]
if(s>=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 = list(map(int, input().split()))
for i in range(N):
    H -= A_list[i]
if H > 0:
    print("No")
else:
    print("Yes")

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

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

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

la = list(map(int, input().split()))
sa = sum(la)

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

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

H,N,*A = map(int,read().split())

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

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

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

s = 0
for i in a:
    s += i

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

Solution (Python):
H, W = 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())
c = input().split()

sum = 0
for number in c:
    sum += int(number)

if sum >= H:
    res = "Yes"
else:
    res = "No"

print(res)

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

Total = 0
for i in range(len(A)):
       Total += A[i]
if  H > Total :
       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 = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] <= 0:
    print('Yes')
else:
    print('No')

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

a.sort(reverse=True)
if h - sum(a) <= 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(len(A)):
    sum += A[i]

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

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

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

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

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

ans = "No"

if(sum(A) >= M[0]):
    ans = "Yes"

print(ans)

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

if sum(i2) >= i[0]:
    print("Yes")
else:
    print("No")

Solution (Python):


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

    flag = False

    for a in A:
        H -= a
        if H <= 0:
            flag = True
            break
    if flag:print("Yes")
    else: print("No")






if __name__ == "__main__":
    main()

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

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

A.sort()


MOVES = len(A)
NUM = MOVES


count = 0
flag = 0

while(MOVES > 0):
  H -= A[MOVES-1]
  MOVES -= 1
  if(H < 1):
    print('Yes')
    flag = 1
    break

if(flag == 0):
  print('No')

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

for val in range(N):
    A_total += int( list_A[val] )
if A_total >= H:
    print ("Yes")
else:
    print("No")

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

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

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

Solution (Python):
H, N = map(int, input().split())
 
s = list(map(int, input().split()))
 
s_sum = sum(s)
 
if s_sum < H:
  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 = input().split()
A = input().split()
H = int(H)
N = int(N)
Aintlist = [int(s) for s in A]
sumdata = 0
for i in range(0,len(Aintlist)):
    sumdata += Aintlist[i]

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

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

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

Solution (Python):
import math
a, b = map(int, input().split()) 
A = sorted(map(int, input().split())) 


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

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

h, n,*a = map(int,read().split())

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

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):
import numpy as np

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

x = np.array(list(map(int, input().split())))

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

Solution (Python):
a, b = map(int, input().split())
x = list(map(int, input().split()))
i = 0
x_sum = 0
while b > i:
    x_sum += x[i]
    i += 1
a -= x_sum
if a <= 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):
import numpy as np
H, N = map(int,input().split())
A = np.array([int(e) for e in input().split()])
if( H <= A.sum()):
  print('Yes')
else:
  print('No')

Solution (Python):

import itertools

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

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

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

sum = 0
ans = None

for a in A:
    sum = sum + a
    if H < a:
        ans = "Yes"
        break
if H > sum and ans == None:
    ans = "No"
else:
    ans = "Yes"

print(ans)

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

waza = input().split()
waza = [int(x) for x in waza]

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

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

a = input().split()
a = [int(i) for i in a]
a.sort(reverse=True)

w = False
for i in range(n):
  h -= a[i]
  if 0 >= h:
    w = True
    break

print('Yes') if	True ==	w else print('No')

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

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

H = INPUT[0]
N = INPUT[1]

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

list_sum = sum(hists)

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

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

Solution (Python):
def run():
  H, N = map(int, input().split())
  A_sum = sum(map(int, input().split()))
  if H-A_sum > 0:
    print('No')
  else:
    print('Yes')
  
if __name__ == '__main__':
  run()

Solution (Python):
a,b=map(int,input().split())
c=list(map(int,input().split()))
for i in range(b):
  a-=c[i]
if a<=0:
  print('Yes')
else:
  print('No')

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

cnt = 0
for a in A:
  H -= a
  cnt += 1
  if H > 0 and cnt == N:
    print("No")
    break
  elif H <= 0:
    print("Yes")
    break

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

for i in range(0,int(n)):
    h = int(h) - int(w[i])

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

Solution (Python):


import numpy as np
from sys import stdin


def get_result(data):
    H, N = data[0]
    A = sorted(data[1])
    return 'No' if sum(A[:N]) < H else 'Yes'

if __name__ == '__main__':
    raw_data = [val.rstrip('\n') for val in stdin.readlines()]
    data = [list(map(int, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)

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 = input().split()

At = 0
for i in range(N):
  At += int(A[i])
  
if At >= H:
  print('Yes')
else:
  print('No')

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

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

if cnt <= 0:
    print('Yes')
else:
    print('No')

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

ss = input().split()
ans = [int(i) for i in ss]

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

Solution (Python):
x = input().split()
H = int(x[0])
N = int(x[1])
A = input().split()
A = [int(l) for l in A]
T = "No"
for i in range(N):
    H = H - A[i]
    if H <= 0:
        T = "Yes"
        break
print(T)

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

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

if H > sum_A:
  print('No')
else:
  print('Yes')

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

sum=0

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

for A in ln:
  sum+=A

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

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

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

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

Solution (Python):
import sys
H,N = map(int,input().split())
Attacks = [_ for _ in map(int,input().split())]
if sum(Attacks) < H:
    print('No')
    sys.exit(0)
if sum(Attacks) >= H:
    print('Yes')
    sys.exit(0)

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
limit = 2
sum = 0
for i in range(N):
  sum += A[i]
  if sum >= H:
    print('Yes')
    exit()
print('No')

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

arr = sorted(arr,reverse=True)
total = sum(arr[:n])

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

Solution (Python):
import math

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

max = 0
for i in hissa:
    max = i + max

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

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

sum = 0
for n in range(N):
  sum = sum + A[n]

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

Solution (Python):
buf = input().split(" ")
H=int(buf[0])
N=int(buf[1])
 
A = list(map(int, input().split())) 
 
A=sorted(A, reverse=True)
 
for i in range(N):
  if H<=0:
    break
  H=H-A[i]
 
if H<=0:
  print("Yes")
else:
  print("No")

Solution (Python):
i = list(map(int, input().split()))
j = list(map(int, input().split()))
if i[0]<=sum(j):
  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):
hp_list = [int(i) for i in input().split()]
attack_list = [int(v) for v in input().split()]

if hp_list[0] <= sum(attack_list):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N=map(int,input().split())
A=[int(i) for i in 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 sum(A)<h:
    print('No')
    
else:
    summ=0
    for i in A:
        h-=i
        if h<=0:
            print('Yes')
            break
    if h>0:
        print('No')

Solution (Python):
h, n = map(int, input().split())
al = list(map(int, input().split()))
al_s = sorted(al, reverse=True)

count = 0
for a in al_s:
    h -= a

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

Solution (Python):
H,N=input().split()
A=list(map(int,input().split()))
h=int(H)
for i in range(int(N)):
  h-=A[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()]

suma=sum(a)

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

Solution (Python):
H, N = map(int, input().rstrip().split())
total = 0
a = list(map(int, input().split()))
for i in a:
    total += i

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin


def main(inp1, inp2):
    h, n = [int(i) for i in inp1.split(sep=' ')]
    a_list = [int(i) for i in inp2.split(sep=' ')]
    if sum(a_list) >= h:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    input1 = stdin.readline().rstrip()
    input2 = stdin.readline().rstrip()
    ret = main(input1, input2)
    print(ret)

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

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

a.sort(reverse=True)

for x in a:
    h = h-x
    if h <= 0:
        break

if h <= 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):
import sys
import fractions
input = sys.stdin.readline
H, N = map(int, input().split())
A = list(map(int, input().split()))
Max = sum(A)
if H-Max <= 0:
    print("Yes")
else:
    print ("No")

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

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

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

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

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

S = np.sum(A_list)

if S >= 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 = (int(x) for x in input().split())
a=list(int(x) for x in input().split())

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

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

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

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

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

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

i=0
r=0

while(i<n):
  r+=list[i]
  i+=1

if(h<=r):
  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):
args = input().split()
args2 = input().split()
H = int(args[0])
N = int(args[1])
S = 0

for i in range(N):
	S += int(args2[i-1])

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

Solution (Python):
import sys

sys.setrecursionlimit(200000)

def dfs(i, total):
    if (i > A - 1):
        return False
    if (total - SPECIALS[i] <= 0):
        return True
    else:
        return dfs(i + 1, total - SPECIALS[i])

H, A = map(int, input().split())
SPECIALS = map(int, input().split())
SPECIALS = list(reversed(sorted(SPECIALS)))

print("Yes" if dfs(0, H) else "No")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    h, n = LI()
    a = LI()
    print("Yes" if h <= sum(a) else "No")
    return



if __name__ == '__main__':
    solve()

Solution (Python):
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")

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

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

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

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

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

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

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

Solution (Python):
inputnum = input().split(" ")
inputa = input().split(" ")
waza = 0

for i in range(int(inputnum[1])):
    waza += int(inputa[i])


result = int(inputnum[0]) - waza

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

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

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

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

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

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

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

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

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

for a in A:
  H -= int(a)

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

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

Asum = sum(A)

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

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

h -= sum(a)

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

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

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

Solution (Python):
num = input().split(" ")
hpoint = int(num[0])
atk = int(num[1])
dmg = map(int,list(input().split(" ")))

if hpoint - int(sum(dmg)) <= 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,a=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())
A = map(int, list(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 A >=h else 'No')

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

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

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

Solution (Python):

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


ma = sum(A)

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

Solution (Python):
def resolve():
    h, A = map(int, input().split())
    atk = list(map(int, input().split()))
    atk.sort(reverse=True)
    for i in atk:
        h -= i
        if h <=0:
            print("Yes")
            exit()
    if h<=0:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    resolve()

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

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

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

Solution (Python):
H, N = map(int, input().lower().split())
total = 0
count = 0
A = []
input_string = input()
A = input_string.split()

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


while(True):
    H = H - total
    if H <= 0:
        count = count + 1
        break
    else:
        count = count + 1

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

Solution (Python):
import numpy as np
H,N=map(int,input().split())
A_list=[int(A) for A in input().split()]
if H > np.sum(A_list):
    print('No')
else:
    print('Yes')

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

sort_A = sorted(A, reverse=True)
if sum(sort_A[:N]) >= H:
  print('Yes')
else:
  print('No')

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

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

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

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

if H<=sum(S):
	print("Yes")
elif H>sum(S):
	print("No")

Solution (Python):
h, n = map(int, input().split())
a = [int(x) for x 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()))
dmg=0
for i in range(n):
  dmg+=a[i]
if dmg>=h:
  print("Yes")
else:
  print("No")

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

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

a = sum(l)

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

Solution (Python):
h, n = [int(_) for _ in input().split()]
a = [int(_) for _ in 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=list(map(int,input().split()))
if H-sum(A_list)<=0:
  print('Yes')
else:
  print('No')

Solution (Python):
h, _ = map(int, input().split())
summation = sum(list(map(int, input().split())))

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

Solution (Python):
H,N = list(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())
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()))
b = 0
for i in a:
    b += i
print("Yes" if b >= h else "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()))

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

Solution (Python):
def LI():
  return [int(s) for s in input().split()]

H,N = LI()
A = LI()

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

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

Solution (Python):

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

if sum(a_list) < h:
    print('No')

else:
    print('Yes')