Problem:
 Score : 200 points    Problem Statement Raccoon is fighting with a monster.  The health of the monster is H .  Raccoon can use N kinds of special moves. Using the i -th move decreases the monster's health by A_i .
There is no other way to decrease the monster's health.  Raccoon wins when the monster's health becomes 0 or below.  If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .      Constraints  1 \leq H \leq 10^9  1 \leq N \leq 10^5  1 \leq A_i \leq 10^4  All values in input are integers.         Input Input is given from Standard Input in the following format:  H  N  A_1  A_2  ...  A_N       Output If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .        Sample Input 1 10 3
4 5 6      Sample Output 1 Yes  The monster's health will become 0 or below after, for example, using the second and third moves.       Sample Input 2 20 3
4 5 6      Sample Output 2 No       Sample Input 3 210 5
31 41 59 26 53      Sample Output 3 Yes       Sample Input 4 211 5
31 41 59 26 53      Sample Output 4 No

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

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

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

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

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

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


cnt =0

for i in range(n):
    cnt += line[i]

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):

H, N = map(int, input().split())
A = [int(s) for s in input().split()]

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

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

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

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

else:
    print("No")

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

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

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

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

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

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

ans = "No"

for a in A:
    H -= a
    if H <= 0:
        ans = "Yes"
        break

print(ans)

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


ans = 'Yes'


if sum(A) < H:
    ans = 'No'


print(ans)

Solution (Python):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    H, N = input(int, int)
    A = input([int, N])
    yesno(H <= sum(A))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

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

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

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

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

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

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

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

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

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

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

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

if s >= 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):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



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



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    h, n = input_to_int_map()
    a = input_to_int_tuple()

    ret = "Yes"
    if h - sum(a) > 0:
        ret = "No"

    return ret


if __name__ == "__main__":
    print(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):
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

H, N = rl()
A = rl()

s = sum(A)

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

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

Solution (Python):


def main():
    *N, = map(int, open(0).read().split())
    H = N[0]
    A = N[2:]

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


main()

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

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

summ = sum(ls)
health = h - summ
if health <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a.reverse()
ans = False
dmg = 0
for i in a:
    dmg += i
    if dmg >= h:
        ans = True
        break
if ans:
    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 = [int(x) for x in input().split()]
if sum(a) >= h:
    print('Yes')
else:
    print('No')

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()))
sum_a = sum(a)
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()))
print('YNeos'[sum(A)<H::2])

Solution (Python):
n,m = map(int, input().split())
l= list(map(int, input().split()))
if n<=sum(l):
    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,*a=map(int,open(0).read().split());print('YNeos'[sum(a)<h::2])

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

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

Solution (Python):
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''


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

Solution (Python):
import sys
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  H, N = map(int, readline().split())
  total = 0
  for a in map(int, readline().split()):
    total += a
  if total>=H:
    print('Yes')
  else:
    print('No')
  
  
  
if __name__ == '__main__':
  main()

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

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

Solution (Python):


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

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

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

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

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
if(H <= sum(A)):
  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()))
a.sort()
k = 0
for num in a:
  h -= num
  k += 1
  if k == n:
    break
if h <= 0:
  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_list = list(map(int, input().split()))
n = len(A_list)
for i in range(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()))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(H: int, N: int, A: "List[int]"):
    return YES if sum(A) >= H else NO



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)]  
    print(solve(H, N, A))

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
H,N=map(int,input().split())
A=[int(i) for i in 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())
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):
x = input()
y = input()
hp = int(x.split()[0])
attack_num = int(x.split()[1])
attack_list = y.split(' ')
sum = 0

for i in attack_list:
    i = int(i)
    sum = sum + i
if sum >= hp:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, N = MAP()
A = LIST()

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

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

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

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

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

import sys
import numpy as np

YES = "Yes"  
NO = "No"  


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

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

T = 0
for a in A: 
    T += a
if T >= H:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    h, n = list(map(int, readline().split()))
    a = list(map(int, readline().split()))
    print("Yes" if sum(a) >= h else "No")


if __name__ == '__main__':
    solve()

Solution (Python):
stdin = open(0).read().split('\n')
H, N = map(int,stdin[0].split())
A = map(int,stdin[1].split())
print('Yes' if sum(A)>=H else 'No')

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

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

Solution (Python):


hp, number = map(int, input().split(" "))
attack = [int(i) for i in input().split(" ")]

total = sum(attack)

if (total >= hp):
  print("Yes")
  exit()
else:
  pass

for i in range(number):
  damage = total - (attack[i])
  if (damage >= hp):
    print("Yes")
    exit()
  else:
    pass

print("No")

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

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

Solution (Python):
def f(h, n, a):
    if sum(a) >= h:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
HP, skills = map(int, input().split())
damage = list(map(int, input().split()))

if sum(damage) >= HP:
  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:
        break
if h <= 0:
    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
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

attack = 0
H, N = list(map(int,readline().split()))
A = list(map(int,readline().split()))
for i in range(N):
  attack += A[i]
if H > attack:
  print('No')
else:
  print('Yes')

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

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

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

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

H = b[0]
N = b[1]

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

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

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

"""

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

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

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

H, N = lr()
A = lr()
bl = sum(A) >= H
print('Yes' if bl else 'No')

Solution (Python):
h,n = 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()))
for i in a:
    h -= i
    if h <= 0:
        print("Yes")
        exit()
print("No")

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

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

Solution (Python):
h,n=map(int,input().split())
A=[int(_) for _ 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()))
sum = sum(A)

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

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

if 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):
import os

def main():
	monster_hp, num = map(int, input().split())
	Attack_point_list = list(map(int, input().split()))
	if monster_hp <= sum(Attack_point_list):
		print("Yes")
	else:
		print("No")

if __name__ == "__main__":
	main()

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

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

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

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

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

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

Solution (Python):

def input1():
	return int(input())


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


def input_array():
	return list(map(int,input().split()))


H,A=input2()
a=input_array()

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

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

Solution (Python):
base = input().split()
h = int(base[0])
skill = input().split()
int_list = []
for i in skill:
    int_list.append(int(i))
if h>sum(int_list):
    print("No")
else:
    print("Yes")

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

ans = "Yes" if sum(a_list) >= h else "No"
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, 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())
num = list(map(int, input().split()))

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

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

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

Solution (Python):
h,n = map(int,input().split())
A = list(map(int,input().split()))
a = sorted(A)[::-1]
s = sum(a[:n])
if s >= h:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

print("Yes") if a_sum >= h else print("No")

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


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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
import math
def print_ans(H, N, ar):
    """Test Case
    >>> print_ans(10, 3, [4, 5, 6])
    Yes
    >>> print_ans(20, 3, [4, 5, 6])
    No
    >>> print_ans(210, 5, [31, 41, 59, 26, 53])
    Yes
    >>> print_ans(211, 5, [31, 41, 59, 26, 53])
    No
    """
    if H <= sum(ar):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    H, N = map(int, input().rstrip().split())
    ar = list(map(int,input().rstrip().split()))
    print_ans(H, N, ar)

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