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

for i in a:
    num+=i
    
if (num >= h):
    print('Yes')
else:
    print('No')

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

Solution (Python):
H= int(input().split()[0])
print('YNeos'[sum([int(x) for x in input().split()])<H::2])

Solution (Python):
h, n = map(int, input().split())
a = [int(i) for i in input().split()]
print('Yes') if sum(a) >= h 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):
hp, n = map(int,input().split())
attack = list(map(int,input().split()))
k = sum(attack)
if hp > k:
    print("No")
else:
    print("Yes")

Solution (Python):
hp,num = map(int, input().split())
atk = map(int, input().split())
atkSum = sum(atk)

ret = "No"
if(atkSum >= hp):
    ret = "Yes"

print("{}".format(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())
a = [int(i) for i in input().split()]
if h <= sum(a):
  print("Yes")
else:
  print("No")

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

Solution (Python):



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

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

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

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

for i in range(h[1]):
  c = a[i] + c

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

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

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

Solution (Python):
def solve(h, n, a):
    return "Yes" if sum(a) >= h else "No"

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

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

array = list(map(int, input().split()))
            
total = sum(array)

if total >= h:
    print('Yes')

else:
    print('No')

Solution (Python):
H, _, *A = map(int, open(0).read().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 sum(a) >= h else "No")

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

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

Solution (Python):
hp,num =map(int,input().split())

damage=list(map(int,input().split()))
damage.sort(reverse=True)

sum=0
for i in damage:
    sum=sum+i
    if sum>=hp:
        print("Yes")
        break

if sum < hp:
    print("No")

Solution (Python):

import math
H, N = map(int, input().rstrip().split())

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

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

else:
    print("No")

Solution (Python):
a=input().rstrip().split(" ")
b=[]

b.append(input().rstrip().split(" "))

sum=0

for i in range(int(a[1])):
  sum+=int(b[0][i])

if int(a[0]) <= sum:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

A_sum = sum(map(int, input().split()))

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

Solution (Python):

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

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

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

Solution (Python):

h, n = map(int,input().split()) 
a = [int(i) for i in 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 = list(map(int,input().split()))
B = [0]*len(A)

while(H>0):
    for i in range(0,N):
        H-=A[i]
        B[i]+=1
ans = True
for i in range(0,N):
    if(B[i]!=1):
        ans=False
        break

print("Yes" if ans 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()))

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

w = sum(a)

if w>=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):
print("Yes" if list(map(int,input().split()))[0] <= sum(map(int,input().split())) else "No")

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

a = list(map(int, input().split()))
a.sort(reverse=True)

sum = 0
for i in a:
  sum += i
  if sum >= h:
    print('Yes')
    exit()

print('No')

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(H: int, N: int, A: "List[int]"):
    if H <= sum(A):
        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,*a=map(int,open(0).read().split());print("YNeos"[sum(a)<h::2])

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(input().split())
for i in range(n):
    h -= int(a[i])

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

Solution (Python):
from sys import stdin
H, N = [int(_) for _ in stdin.readline().rstrip().split()]
A = [int(_) for _ in stdin.readline().rstrip().split()]
for i in range(N):
    H -= A[i]
if H <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
def IN(): return map(int,input().split())
ans = 0; mod = pow(10,9)+7
h,n=IN()
a=list(IN())
print('Yes'if sum(a)>=h else 'No')

Solution (Python):
List=[]
num = 0

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

for i in range(N):
    a = int(L[i])
    List.append(a)

for i in range(len(List)):
    num = num + List[i]

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

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

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

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

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

Solution (Python):

from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
INF = float('inf')

H, N=map(int, input().split())
An=sorted(list(map(int, input().split())), reverse=True)
for a in An:
    H -= a

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

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

attack_sum = sum(A)


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

Solution (Python):


"""
name: 153B.py
プログラムの説明
"""

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

    TotalA = 0
    for i in A:
        TotalA += int(i)
    
    if H>TotalA:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    main()

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

Solution (Python):
hp,n=map(int,input().split())
at=list(map(int,input().split()))
if(hp>sum(at)):
    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(' '))
numlist = input().split(' ')
count = 0
for num in numlist:
  count += int(num)
  
if count >= 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('No' if sum([int(_) for _ in input().split()]) < H else 'Yes')

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

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

sum=0
for Ai in A:
  sum += Ai

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

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

s = sum(A)

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

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

for attack in Ai:
    H -= attack

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

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

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,N = MI()
    A = sum(LI())
    print("YNeos"[H>A::2])
if __name__ == '__main__':
    main()

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

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

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()
H=int(H)
N=int(N)

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

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

if count>=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
 
 
hp, length = [int(v) for v in input().split(' ')]
damages = sorted([int(d) for d in input().split(' ')])
 
 
for d in reversed(damages):
    hp -= d
    if hp <= 0:
        print('Yes')
        sys.exit(0)

print('No')

Solution (Python):
def solve(string):
    h, n, *a = map(int, string.split())
    return "Yes" if h <= sum(a) else "No"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

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

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

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

all_damege = 0
for i in Ai:
    all_damege+=i
if H<=all_damege:
    print('Yes')
else:
    print('No')

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

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

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

sum = sum(a)

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

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

Solution (Python):
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
 
H = int(l1[0])
A = int(sum(l2))
result = H - A
if result <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
input_num=[input() for i in range(2)]

n=input_num[0].split()
n=list(map(int,n))
a=input_num[1].split()
a=list(map(int,a))

N=sum(a)

if n[0]<=N:
  print("Yes")
else:
  print("No")

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

s = sum(moves)
if s < h:
    resutl = "No"
else:
    resutl = "Yes"

print(resutl)

Solution (Python):
H,N=map(int,raw_input().split())
A=map(int,raw_input().split())
A.sort(reverse=True)
ans=False
for i in range(N):
  H = H - A[i]
  if H<=0:
    ans = True
    break
if ans:
  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):




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

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

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

    return 0

if __name__ == '__main__':
    
    

    
    
    import doctest
    doctest.testmod()

    
    import sys
    sys.exit(main())

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

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

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

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

Solution (Python):
hp, atk = input().split()

hp = int(hp)
atk = int(atk)

value = 0

numlist = list((input().split()))

numlist = list(map(int, numlist))

for i in range(atk):
    value = value + numlist[i]

if value >= hp:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())
l=list(map(int,input().split()))
s=sum(l)
if n<=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  = 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 = [int(i) for i in input().split()]

print("Yes") if sum(A) >= H 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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

h,n = inpl()
a = inpl()
print('Yes' if sum(a)>=h else 'No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if h <= sum(a[:n+1]):
    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 = list(map(int,input().split()))
l = list(map(int,input().split()))
if a[0]-sum(l)<=0:
  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, = map(int, input().split())

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

Solution (Python):
'''
211 5
31 41 59 26 53
'''
power, moves = [int(x) for x in input().split()]
powers = [int(x) for x in input().split()]
print("No" if sum(powers) < power else "Yes")

Solution (Python):

h,n=map(int,raw_input().split())
a=map(int,raw_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):
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())

for a in a_list:
    h -= a

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

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

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

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

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

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

Solution (Python):

a,b=map(int, input().split())
A = list(map(int, input().split()))
sum = 0
for at in A:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

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

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

Solution (Python):

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


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

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

def main():
    H, _, *A = map(int, open(0).read().split())
    print("Yes" if sum(A) >= H else "No")


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

print("Yes" if sum(An) >= 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):
l = list(map(int, input().split()))
h =list(map(int, input().split()))
total=0
for i in range(l[1]):
    total=h[i-1]+total
if total>=l[0]:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
from sys import stdin

h, n = (int(v) for v in stdin.readline().split())
moves = (int(v) for v in stdin.readline().split())

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

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

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

s = sum(a)

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

Solution (Python):
s = [list(map(int,input().split())) for i in range(2)]
t = s[0]
H = t[0]
N = t[1]
u = s[1]
if sum(u) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):


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

Solution (Python):
a,b  =map(int,input().split())
nums = map(int,input().split())
if sum(nums)>= a:
  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)):
    h -= a[i]
if h>0:
    print("No")
else:
    print("Yes")

Solution (Python):
a,b=map(int,input().split())
c=list(map(int,input().split()))
q=sum(c)
if a<=q:
  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):
HP, N = map(int, input().split())

S = sum(map(int, input().split()))

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

Solution (Python):
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
answer = "No"
i = 0
while (i < n):
  h -= a[i]
  if(h <= 0):
    answer = "Yes"
    break
  else:
    i += 1
print(answer)

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=input()
list=a.split()
sum=0
for item in list:
    sum=sum+int(item)

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

Solution (Python):
import sys

def propare():
    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_list = []
    for i in range(N):
        A_list.append(int(next(tokens)))

    solve(H, N, A_list)

def solve(H: int, N: int, A_list: list):
    sum_a = 0
    for a in A_list:
        sum_a = sum_a + a

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

    return


 
if __name__ == "__main__":
    propare()

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

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

count = 0
for ax in a:
  count += ax
if count >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
hn = [int(s) for s in input().split()]
h = hn[0]
arr = [int(s) for s in input().split()]
if sum(arr) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
import math


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

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

total = sum(data)

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

Solution (Python):
H,N = [int(number) for number in input().split()]
A = [int(number) for number 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('Yes')
else:
    print('No')

Solution (Python):
class Main:
    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 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):
n,_=list(map(int,input().split()))
print('YNeos'[sum(map(int,input().split()))<n::2])

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())
s = sum(map(int, input().split()))
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):
import math
a,b = map(int,input().split())
arr = list(map(int,input().split()))
f = 0
for i in arr:
    a-=i
    if a<=0:
        f = 1
        break
if f == 1:
    print("Yes")
else:
    print("No")