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-----
10 3
4 5 6

-----Sample Output-----
Yes

The monster's health will become 0 or below after, for example, using the second and third moves.

Difficulty: introductory

Starter code:

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

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


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

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

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

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

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

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


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

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

import numpy as np

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

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

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

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


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

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

tot = sum(A)
hp = h - tot
if(hp <= 0) :
    print("Yes")
else :
    print("No")

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

for a in A:
  h -= a
  if h<=0:
    flag = True
    break

print("Yes" if flag else "No")

def main():
	h, n = list(map(int, input().split()))
	l = [int(v) for v in input().split()]
	total = sum(l)
	if total>= h:
		return "Yes"
	return "No"	

def __starting_point():
    print((main()))

__starting_point()

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

H, N = map(int, input().split())
A_list = []
for i in range(1, N+1):
    A_list.append("A_" + str(i))

A_list = map(int, input().split())
A_total = sum(A_list)

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

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

Sum=sum(List)

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

#アライグマはモンスターと戦っています。
# モンスターの体力は H です。
#アライグマは N 種類の必殺技を使うことができ、
#i 番目の必殺技を使うとモンスターの体力を Ai 減らすことができます。
#モンスターの体力を 0 以下にすればアライグマの勝ちです。

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

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

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

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

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

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

h,n=map(int,input().split());print('YNeos'[sum(map(int,input().split()))<h::2])

h = input()
h = h.split()
n = int(h[1])
h = int(h[0])
a = input()
a = a.split()
c = int(a[0])
for b in range(n-1):
    c = c + int(a[b+1])
if h>c:
    print("No")
else:
    print("Yes")

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

AA = sum(A)

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

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

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

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

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

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

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

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

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

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

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

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


print('YNeos'[sum(A)<h::2])

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

H,M = map(int,input().split())
attack = list(map(int,input().split()))
if H - sum(attack) <=0:
    print('Yes')
else:
    print('No')

H, N = [int(n) for n in input().split()]
A = sum([int(n) for n in input().split()])

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

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

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

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

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

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

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

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

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

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

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

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

H,M = map(int,input().split())
attack = list(map(int,input().split()))
if H - sum(attack) <=0:
    print('Yes')
else:
    print('No')

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


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


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

Total_attack = sum(A)

if H - Total_attack <= 0:
    print('Yes')

else:
    print('No')

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

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


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


H, N = map(int, input().split())
A_list = []
for i in range(1, N+1):
    A_list.append("A_" + str(i))

A_list = map(int, input().split())
A_total = sum(A_list)

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

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

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

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

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

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


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

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

health, num = map(int, input().split())
num_list = [num for num in list(map(int, input().split()))]
for _ in num_list:
  health -= _
  
if health > 0:
  print("No")
else:
  print("Yes")

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

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

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

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

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

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

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


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

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

import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    h, n = inl()
    a = inl()
    return sum(a) >= h


print("Yes" if solve() else "No")



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

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

h, n = list(map(int,input().split()))
a = list(map(int,input().split()))
hitpoint=h
atack = a[:]
for e in atack:
    hitpoint -= e
    if hitpoint <= 0:
        break
if hitpoint <= 0:
    print("Yes")
else:
    print("No")


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

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

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

life=H
for i in range(N):
    life-=A[i]
    
if life<=0:
    print('Yes')
else:
    print('No')

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

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


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

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

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

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

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

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

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

# モンスターの体力H
# アライグマの必殺技の種類N
# i番目の必殺技使うと、モンスターの体力Ai減らせる

# H - (A1 + A2 + A3...) <= 0 となるなら 'Yes',
# ならないなら'No'が出力される

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

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

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

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

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

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

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


H, N = map(int, input().split())
Skills = list(map(int, input().split()))
Total = sum(Skills)

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

h, n = map(int, input(). split())
list01 = input().split()
list02 = [int(a) for a in list01]
if sum(list02) >= h:
    print('Yes')
else:
    print('No')

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

answer = sum(A)

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

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


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

H, N = map(int, input().split())
A = list(map(int, input().split()))
print("YNeos"[sum(A)<H::2])

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

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

H, N = map(int, input().split())
A = list(map(int, input().split()))
def hissatu():
    HP = H -sum(A)
    if HP>0:
        return "No"
    else:
        return "Yes"
print(hissatu())

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

H, N = map(int, input().split())
for Ai in list(map(int, input().split())):
  H -= Ai
if H > 0:
  print('No')
else:
  print('Yes')

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


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

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

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

if H - sum(data) > 0:
    print('No')
else:
    print('Yes')

'''
問題：
    アライグマはモンスターと戦っています。

    モンスターの体力は H です。
    アライグマは N 種類の必殺技を使うことができ、
    i 番目の必殺技を使うとモンスターの体力を Ai 減らすことができます。
    必殺技を使う以外の方法でモンスターの体力を減らすことはできません。

    モンスターの体力を 0 以下にすればアライグマの勝ちです。

    アライグマが同じ必殺技を
    2 度以上使うことなくモンスターに勝つことができるなら Yes を、
    できないなら No を出力してください。
'''

'''
制約：
    1 ≦ H ≦ 1000000000
    1 ≦ N ≦ 100000
    1 ≦ Ai ≦ 10000
    入力中のすべての値は整数である。
'''

# 標準入力から H, N, Ai を取得する
h, m = list(map(int, input().split()))
a = list(map(int, input().split()))

# 必殺技を1回ずつ使った場合、モンスターの体力をどれだけ削れるか計算する
hissatsu_hp = 0
for i in range(0, m):
    hissatsu_hp += a[i]

# 同じ必殺技を使わずアライグマを倒せるか判定して結果を出力する
result = ""
if hissatsu_hp >= h:
    result = "Yes"
else:
    result = "No"

print(result)


attack = []
h, n = map(int, input().split())
a = input().split()

for move in a:
    move = int(move)
    attack.append(move)

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

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

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


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

H,N=list(map(int,input().split()))
A=list(map(int,input().split()))
s=0
flg=True
for i in range(N):
  s+=A[i]
  if s>=H:
    print('Yes')
    flg=False
    break
if flg:
	print('No')


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

hp = 0
result = 'No'

for i in range(n):
    hp = hp + a[i]
    if hp >= h:
        result = 'Yes'
        break

print(result)


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

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

a = (sum(A))

if a >= H:
    ans = "Yes"
else:
    ans = "No"

print(ans)


# B - Common Raccoon vs Monster

# H N
H, N = list(map(int, input().split()))
my_list = list(map(int, input().split(maxsplit=N)))

if H <= sum(my_list):
    answer = 'Yes'
else:
    answer = 'No'

print(answer)


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


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

x = sum(a)

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

# モンスターの体力は H
# アライグマは N 種類の必殺技を使うことができ
# i番目の必殺技を使うとモンスターの体力を Ai 減らすことができます。
# モンスターの体力を0以下にすれば、アライグマ勝ち
# アライグマが同じ必殺技を 2 度以上使うことなくモンスターに勝つことができるなら Yes を、
# できないなら No を出力してください。

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

if H - sum(data) > 0:
    print('No')
else:
    print('Yes')


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

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

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

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

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

# モンスターの体力は H
# アライグマの必殺技は N 種類
# アライグマが同じ必殺技を 2 度以上使うことなく
# モンスターに勝つことができるなら Yes を、
# できないなら No を出力。

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

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

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