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

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

Solution (Python):
from sys import stdin

x,y = [int(x) for x in stdin.readline().rstrip().split()]
li = list(map(int,stdin.readline().rstrip().split()))

z = 0
for i in li:
    z = z + i

if(z<x):
    print("No")
else:
    print("Yes")

Solution (Python):
str = input().split()
hp = int(str[0])
n = int(str[1])
str = input().split()
for damage in str:
    hp -= int(damage)

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

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

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

for i in num:
  h -= i

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

Solution (Python):


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

for i in a:
  sum += i

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

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

a=s[0]
for i in range(s[1]):
  a -= m[i]

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

Solution (Python):
import numpy as np


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

ones = np.ones(N)
if np.dot(ones, np.array(li)) >= H:
    print('Yes')
else:
    print('No')

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

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

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):
a, b = map(int, input().split())
q = [int(x) for x in input().split()]
p = sum(q)
if p >= a:
    print("Yes")
else:
    print("No")

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

Solution (Python):
data = [int(_) for _ in input().split()][0]
num = sum([int(_) for _ in input().split()])
if num < data:
  print("No")
else:
  print("Yes")

Solution (Python):
data = [int(_) for _ in input().split()]
num = [int(_) for _ in input().split()]
if sum(num) < data[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 sum(A) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):


H, N = list(map(int, input().split(" ")))
T = list(map(int, input().split(" ")))
f = False

for i in T:
    H = H - i
    if(H <= 0):
        print("Yes")
        f = True
        break

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

if __name__ == '__main__':
    
    

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

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

Solution (Python):
a,b=input().split()
l = list(map(int, input().split()))
a=int(a)
b=int(b)
if a <= sum(l):
  print('Yes')

else:
  print('No')

Solution (Python):


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

result = "No"
total = 0
for i in aList:
  total = total + i

if total < h :
  result = "No"
else :
  result = "Yes"

print(result)

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

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

Solution (Python):
H, N = map(int, input().split())
A = 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()))
 
total = 0
for l in range(len(List)):
  total += List[l]
  
if H > total:
  print('No')
  
elif H <= total:
  print('Yes')

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

Solution (Python):
s, _ = map(int, input().split())
sm = sum(list(map(int, input().split())))
print('Yes' if s - sm <= 0 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 print('No')

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

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

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

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

sum = 0

for i in A:
    sum += i

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

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

A = input().split()

sumA = 0
for i in A:
  sumA += int(i)

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

Solution (Python):
values = input()
H_point, Num_skill = map(int, values.split())
values = input()
A_damage = map(int, values.split())

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

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

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

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

Solution (Python):
S_hn = input().split(" ") 
S_a = input().split(" ") 

H = int(S_hn[0]) 
N = int(S_hn[1]) 
A = [] 
for i in range(N):
  A.append(int(S_a[i]))
  
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 = input().split()
A = [int(a) for a in 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()))

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


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


sys.setrecursionlimit(1000000)
mod = 1000000007


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



if __name__ == "__main__":
    solve()

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(" "))
A = list(map(int,input().split(" ")))
flag = False
for i in range(N):
    H -= A[i]
    if H <= 0:
        print("Yes")
        flag = True
        break
if flag == False:
    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")
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=[int(i) for i in input().split()]
i=0
if sum(a)>=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 = 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) <= 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N,K = [int(x) for x in input().split()]
n=[int(x) for x in input().split()]
print("Yes" if sum(n)>=N else "No")

Solution (Python):
nums=[int(i) for i in input().split()]
atacck=[int(j) for j in input().split()]

damage=0

for k in range(nums[1]):
    damage+=atacck[k]
    
if damage<nums[0]:
    print("No")
    
else:
    print("Yes")

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

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

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

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

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

for val in A:
	sum = sum + val

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

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

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

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

if h <= sum(int(i) for i in a):
	print('Yes')
else:
	print('No')

Solution (Python):
import sys



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

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

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

Solution (Python):
import math
h, n = map(int, input().split())
attack_list = list(map(int, input().split()))
damage = 0
for attack in attack_list:
  damage += attack
  if damage >= h:
    print('Yes')
    exit()
print('No')

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

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

damage = 0

for i in range(0,n):
    damage += a[i]
if damage < h:
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
myinput_H = input()
myinput_A = input()
mylist_H = list(map(int, myinput_H.split(" ")))
H = mylist_H[0]
list_A = list(map(int, myinput_A.split(" ")))
sum_A = sum(list_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 sum(a) >= 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())
skills = list(map(int, input().split()))

sum = 0
for i in range(N):
    sum += skills[i]

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

Solution (Python):
def can_win_without_repeated_move(health, special_moves_damages) -> str:
    """
    Given a monster's health and a number of special moves with differ damages,
    can we deplete the monster's health without repeating the same move twice?
    :param health: int
    :param special_moves_damages: list[int]
    :return: str
    """
    return 'Yes' if health <= sum(special_moves_damages) else 'No'


if __name__ == '__main__':
    print(can_win_without_repeated_move(list(map(int, input().split()))[0], list(map(int, input().split()))))

Solution (Python):
def can_win_without_repeated_move(health, special_moves_damages) -> str:
    """
    Given a monster's health and a number of special moves with differ damages, 
    can we deplete the monster's health without repeating the same move twice?
    :param health: int
    :param special_moves_damages: list[int] 
    :return: str
    """
    return 'Yes' if health - sum(special_moves_damages) <= 0 else 'No'


if __name__ == '__main__':
    print(can_win_without_repeated_move(list(map(int, input().split()))[0], list(map(int, input().split()))))

Solution (Python):
H, N=map(int, input().split())
List=list(map(int,input().split()))
a = 0
for j in range(N):
  a = a + List[j]

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

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

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

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

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

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

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

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

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

A_list = [i for i in map(int, input().split())]

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

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

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

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

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

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

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

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

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

print('Yes' if h <= sum(a_lst) 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):
x, y = (int(x) for x in input().split())
a = (int(x) for x in input().split())

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

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

print("YNeos"[sum(a)<h::2])

Solution (Python):
h,n=[int(i) for i in input().split()];l=[int(i) for i in input().split()]
print(['No','Yes'][h<=sum(l)])

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

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

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

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

attack_sum = sum(attack_list)

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

a.sort(reverse=True)

attack = sum(a[:n])

if attack >= 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()))
total = 0
for i in range(0, 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()))

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

Solution (Python):
import sys
input = sys.stdin.readline
H,N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sum = 0
for i in range(N) :
    sum += A[i]
if sum >= H :
    print("Yes")
else :
    print("No")

Solution (Python):
a, b = map(float, input().split())
attack_list = list(map(float, input().split()))

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

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

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

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

A = sum(int(i) for i in input().split())

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

Solution (Python):
hp_list = input().split(" ")
h = int(hp_list[0])
counts = int(hp_list[1])

death_blows = input().split(" ")
damages = 0
for i in death_blows:
  damages += int(i)

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

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

for i in c:
  total += i

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

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

t_damages = sum(damages)

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

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


lst = input().split(" ")
hissatsu = []
for l in lst:
  hissatsu.append(int(l))
sum_h = sum(hissatsu)

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

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

sum = sum(data)

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

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

Solution (Python):

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()



def main():
    H,N = isRaw()
    As = isRaw()
    return "Yes" if sum(As)>=H else "No"


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

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

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

if atack < h:
  print("No")
else:
  print("Yes")

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

Solution (Python):


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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,m = LI()
    a = LI()
    s = sum(a)
    if s >= n:
        return "Yes"

    return "No"


print(main())

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

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

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

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

Solution (Python):



H, N = input().split()
A_list = input().split()
A_list.sort(reverse=True)

damage = 0
flg = True
for s in A_list:
    damage += int(s)
    if damage >= int(H):
        print("Yes")
        flg = False
        break
if flg:
    print("No")

Solution (Python):
H,N=[int(thing) for thing in input().split(" ")]
A_list=[int(thing) for thing in input().split(" ")]

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

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

Solution (Python):


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

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

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

A = input().split()

result = 0

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

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

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

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

if h <= a:
    res = "Yes"
else:
    res = "No"

print(res)

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

Solution (Python):

import sys
import math

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

if (H-sum(l)<=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 range(len(A)):
    s=s+A[i]
if s<H:
    print('No')
else:
    print('Yes')

Solution (Python):
def wczytaj_liste():
    ciag = input()
    rozdzielona_lista = ciag.split()
    odp = []
    for wyraz in rozdzielona_lista:
        liczba = int(wyraz)
        odp.append(liczba)
    return odp

def Raccon_vs_Monster():
    H, N = wczytaj_liste()
    ruchy = wczytaj_liste()
    suma_obrazen = sum(ruchy)
    if suma_obrazen >= H:
        print('Yes')
    else:
        print('No')

Raccon_vs_Monster()

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

a.sort(reverse=True)

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

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

if sum>=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+=i

if sum>=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+=i

if sum>=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+=i

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

Solution (Python):


n,m = map(int,input().split())
da = list(map(int,input().split()))

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

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

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

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

H = S1[0]

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

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

Solution (Python):
import sys
h, n = map(int, sys.stdin.readline().split())
a = []
a.extend(map(int, sys.stdin.readline().split()))

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