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

for dmg in n_list:
    h = h - dmg
    if h <= 0:
        print ("Yes")
        exit (0)

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

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

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

Solution (Python):

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

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


if __name__ == '__main__':
    main()

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

import sys

YES = "Yes"  
NO = "No"  


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


a=input().split()


for i in a:
    h -= int(i)

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

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd
from itertools import permutations, combinations

def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



H, N = mulinputs()
As = list(mulinputs())

As.sort(reverse=True)

flg = False
sum = 0
for a in As:
    sum += a
    if H - sum <= 0:
        flg = True
        break


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

Solution (Python):



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

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

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

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

Solution (Python):
H,N=map(int,input().split())
ar= list(map(int, input().split()))
sumd=0
for i in range(N):
    sumd+=ar[i]

if sumd >= H:
    print("Yes")

else:
    print("No")

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

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

Solution (Python):
h, at = input().split(' ')
h = int(h)
at = int(at)

hissatsu_l = [int(a) for a in input().split(' ')]

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

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

if sum(p)>=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 = [ int(x) for x 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()))

S = sum(a)

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, *a = map(int, open(0).read().split())

sum = 0
for a_i in a:
  sum += a_i
  
if sum >= h:
  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):
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    h, n = get_list()
    li = get_list()
    if sum(li)>=h:
        print("Yes")
    else: print("No")
 
 
 
''' Pythonista fLite 1.1 '''
import sys




input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

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


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

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

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

total = sum(A)

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

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

for i in range(len(A)+1):
    if H-sum(A,i)<=0:
        print("Yes")
        break
    else:
        print("No")
        break

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

attack = 0
for i in range(H[1]):
    attack += A[i]

if (H[0] - attack) > 0:
    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('No')
else:
  print('Yes')

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

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

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


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

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

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

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

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

ans = h - sum(lis)

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

Solution (Python):
h,n=map(int,input().split())
ai=[]
asum=0
for i in map(int,input().split()):
    asum=asum+i
if asum<h:
    print("No")
else:
    print("Yes")

Solution (Python):
a, b = map(int, input().split())
array = list(map(int, input().strip().split()))
total = sum(array)
out = "Yes" if a <= total else "No"
print(out)

Solution (Python):
import math as m
h,n = map(int,input().split())
a = list(map(int,input().split()))
res = sum(a)

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

Solution (Python):
H,N = map(int,input().split())
a = [int(s) for s in input().split()]
s = H - sum(a)
if s <= 0:
    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):
a,b = map(int,input().split())
N = list(map(int,input().split()))
print("Yes" if sum(N) >= a else "No")

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

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

for i in range(0,N):
    H = H - A_list[i]

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

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

atack= sum(A)
if H-atack<=0:
    print("Yes")
elif H-atack>0:
    print("No")

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

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

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

Solution (Python):
t = []
t = list(map(int, input().split()))

n = t.pop()
h = t.pop()

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

s = sum(a)

if h <= s:
    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=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):
import numpy as np
H,N = list(map(int,input().split()))
A = list(map(int,input().split()))

s = np.array(A).sum()

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

Solution (Python):
h, n = map(int, input().split())
li = list(map(int, input().split()))
li.sort(reverse=True)
ans = 'No'
for i in li:
  if n <= 0:
    break
  h = h - i
  n -= 1
if h <= 0:
  ans = 'Yes'
  
print(ans)

Solution (Python):
H, N = [int(num) for num in input().split(' ')]
sum=0

for Ai in [int(num) for num in input().split(' ')]:
  sum += Ai
  
if sum >= H:
	print('Yes')
else:
	print('No')

Solution (Python):
h, n = tuple(map(int, input().split()))
arts = list(map(int, input().split()))
print("Yes" if h <= sum(arts) 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())
h=list(map(int,input().split()))
t=0
for i in h:
  t+=i
if a>t:
  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 = list(map(int, input().split()))
a = list(map(int, input().split()))

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

Solution (Python):
def main(h: int, n: int, a: list):
    for i in sorted(a):
        h -= i
        if h <= 0:
            print("Yes")
            return

    print("No")


if __name__ == "__main__":
    h, n = map(int, input().split())
    a = list(map(int, input().split()))

    main(h, n, a)

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

ans = sum(lista)

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

Solution (Python):

n,k=map(int,input().split())
a=[int(i) for i in input().split()]
if(sum(a)>=n):
	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):
from sys import stdin
H,N = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) for x in stdin.readline().rstrip().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())
nums = list(map(int, input().split()))

a = sum(nums)

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

Solution (Python):
data = input().split()
strengh = int(data[0])
attack = input().split()
attack = sum([int(a) for a in attack])
if strengh > attack:
    print("No")
else:
    print("Yes")

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

sum = 0
for a in input().split():
  a = int(a)
  sum += a

if sum >= 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):
attack=list(map(int,input().split()))
damage=list(map(int,input().split()))
A=0
for i in range(attack[1]):
  A+=damage[i]

if A>=attack[0]:
  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())
As = map(int,input().split())
print('Yes' if sum(As)>=H else 'No')

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

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

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

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

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

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

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

if __name__ == "__main__":
  main()

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

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


a = sum(l)

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from copy import deepcopy
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = float('INF')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


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

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

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

A = sorted(A, reverse=True)
for a in A:
  h -= a
  if h <= 0:
    print('Yes')
    sys.exit()
print('No')
sys.exit()

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

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

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

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

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

result = H - sum(waza)

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

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

import numpy as np

A = np.array(A)
su = A.sum()

if (hn[0]<=su):
    print("Yes")
else:
    print("No")

Solution (Python):


import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy


def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z


def bfs(SS, x, y, H, W):
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" 
    for i in range(4): 
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      
      
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" 
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      
  return mlength

def brick(a,n,m,N):
  
  if not m in a[n:]:
    print(N-(m-1))
  else:
    
    brick(a,a[n:].index(m),m+1,N)



HA = str(input()).split()
H = int(HA[0])
A = int(HA[1])
a = [int(x) for x in input().split()]

count = 0
for i in range(A):
    count += a[i]

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

Solution (Python):
H , N = map ( int , input().strip().split(" ") ) ;
L = sum ( map ( int , input().strip().split(" ") ) ) ;
print ( "Yes" if L >= 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):
n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(k):
    n-=a[i]
if n<=0:
    print("Yes")
else:
    print("No")

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


import numpy as np

if H > np.sum(An):
    print('No')
else:
    print('Yes')

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

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

total=sum(mylist)

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

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

Solution (Python):
S=list(map(int,input().split()))
N=list(map(int,input().split()))
if sum(N)>=S[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())
li=list(map(int,input().split()))
d=0

for i in range(N):
    d=d+li[i]

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

Solution (Python):

import math
import numpy as np

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

An = np.array(input().split(" "), dtype=np.int)

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

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split())) 
total = 0
for ai in a:
  total += ai
if total >= 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 A:
  sum = sum + i

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

power_sum = 0
for i in range(len(a_list)):
    power_sum += a_list[i]

if power_sum >= 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')
else:
    print('No')

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

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

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

Solution (Python):

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

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

S = sum(A)

print("Yes" if H <= S else "No")

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

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

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

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

a_list.sort()

sum_d = 0

for i in range(b):
    sum_d += a_list[i-1]

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

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

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

Solution (Python):
import math 
h, n = map(int, input().split())
yes = 'Yes'
no = 'No'
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()))
s=0
for x in a:
    s+=x
if s>=h:
    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()]
a=list(map(int,input().split()))
if(sum(a)>=h):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
import math

P = [int(p) for p in input().split()]
H = P[0]

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

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

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

Solution (Python):
H, N = input().split(" ")
As = input().split(" ")
num_As = [int(A) for A in As]
sum_A = sum(num_As) 
if sum_A >=int(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

YES = "Yes"  
NO = "No"  


def solve(H: int, N: int, A: "List[int]"):
    if sum(A) >= H:
        print(YES)
    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):
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()))
ans = H / sum(A)

if ans <= 1:
  print("Yes")
else:
  print("No")

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

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

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

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

skill = list(map(int, input().split()))
power = sorted(skill, reverse=True)

if sum(skill[:N]) >= H:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a, b = map(int, input().split())
list_score = list(map(int, input().split()))
ans = "No"

if a <= sum(list_score):
    ans = "Yes"

print(ans)

Solution (Python):
s = input().rstrip().split(' ')
h = int(s[0])
n= int(s[1])
As = list(map(int, input().rstrip().split(' ')))

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

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

aaa = list(map(int, input().strip().split()))
at = 0
for i in range(a):
  t = aaa[i]
  at += t

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

Solution (Python):


import math


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, N = inputIntList()
  A = inputIntList()
  ans = 'Yes' if sum(A) >= H else 'No'
  return ans


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

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

ATK=0

for i in range(N):
	ATK+=A[(N-1)-i]
	

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

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

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

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

Solution (Python):
H, N = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
total = sum(A)
if total >= H:
  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)
A_all = np.sum(A)

if H <= A_all:
    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())
List = list(map(int,input().split()))
Sum = sum(List)
if Sum >= H:
  print('Yes')
else:
  print('No')

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

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

line = input().rstrip().split(' ')
a = [0] * n
sum = 0
for i in range(n):
    a[i] = int(line[i])
    sum += a[i]

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

Solution (Python):


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

summ = sum(A)

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

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

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

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

Solution (Python):

h,n = [int(i) for i in input().split()]
data = [int(i) for i in input().split()]
data.sort(reverse=True)
x = sum(data[:n])

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

Solution (Python):

def main():
    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')
    else:
        print('No')


if __name__ == "__main__":
    main()

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

for a in a_list:
    H -= a

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

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

s = 0
for i, n in enumerate(A):
    s += n

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):
import collections
import itertools as it
import math
import numpy as np








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

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

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

attacks = input().split(" ")
ans = 0

for a in attacks:
    ans += int(a)

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

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
sum_A = 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()))
msg = "No"
for i in range(N):
    H -= A[i]
    if H <= 0:
        msg = "Yes"
        break
print(msg)

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

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