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


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

h,n = LI()
a = LI()
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):
HP,number=map(int,input().split())
a=list(map(int, input().split()))

i=0
attack=0

while True:
  attack=attack+a[i]
  i=i+1
  if i==number:
    break

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

Solution (Python):
import sys

read = sys.stdin.read

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

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

Solution (Python):
h, n = tuple(map(int, input().rstrip().split()))
a = list(map(int,input().rstrip().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())
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):

s = [int(x) for x in input().split()]

hp = s[0]
atype =s[1]


n = [int(y) for y in input().split()]


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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	H,N = inputMap()
	A = inputList()
 
	tmp = 0
	for i in A:
		tmp += i
 
	if tmp >= H:
		print("Yes")
	else:
		print("No")



if __name__ == "__main__":
	main()

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

attackSum = 0
for a in A:
    attackSum += a

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

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

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

if HP<=0:
    print('Yes')
elif HP>0:
    print('No')

Solution (Python):

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

Solution (Python):
h,n,*a=map(int,open(0).read().split())
print('YNeos'[sum(a)<h::2])

Solution (Python):
H, N = input().split()
this_list = [int(x) for x in input().split()]
a = sum(this_list)
if(a>= int(H)):
    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())
sum = 0

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

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

Solution (Python):
import math

a,b=map(int,input().split())
array = map(int,input().split())

sum = 0

for skill in array:
  a -= skill
if(a <= 0):
  print("Yes")
else:
  print("No")

Solution (Python):
import math
h, n = map(int, input().split())
li = map(int, input().split())
s = sum(li)

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

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

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

Solution (Python):
import sys

use_clipboard=True
bbn=1000000007
	


		
def main():
	h, n = map(int, input().split())
	al=list(map(int, input().split()))
	ret = 'Yes' if sum(al)>=h else 'No'
	print(ret)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
class input_clipboard:
	def __init__(self,s):
		self.input_l=s.splitlines()
		self.ii=0
		
	def input(self):
		ret = self.input_l[self.ii]
		self.ii+=1
		return ret

if __name__ == "__main__":
	if sys.platform =='ios':
		if use_clipboard:
			import clipboard
			input_text=clipboard.get()
			ic=input_clipboard(input_text)
			input = lambda : ic.input()
		else:
			sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
def f(L,H):
    N=len(L)
    if sum(L)>=H:
        return "Yes"
    else:
        return "No"
H,N=map(int,input().split())
L=list(map(int,input().split()))
print(f(L,H))

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

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

Ar = Input2

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

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

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

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

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

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

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

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

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


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

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

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

Solution (Python):
inp = raw_input().split()
H = int(inp[0])
N = int(inp[1])
A = raw_input().split()
A = list(map(int, A))

def attack_sum():
	sum_damage = 0
	for i in A:
		sum_damage += i
	return sum_damage

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

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

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

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

m = [i for i in input().split()]

res = 0

for i in m:
    res += int(i)

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

Solution (Python):
H, N = 0, 0
while (H < 1 or H > 10**9) and (N < 1 or N > 10**5):
  H, N = input().split()
  H, N = int(H), int(N)

flag = False
while flag == False:
  A = input().split()
  flag = (sum([((int(i) >= 1) and (int(i) <= 10**4)) for i in A]) == len(A) and N == len(A))

A = [int(s) for s in A]

for a in A:
  H -= a

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

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

Solution (Python):
H, N = map(int, input().split())
move = [int(a) for a in map(int, input().split())]

H -= sum(move)
if 0 >= H:
    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, 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 = input().split()
H = int(h)
N = int(n)
lis_A = list(map(lambda x: int(x), input().split()))
sum_A = sum(lis_A) 
if sum_A >= H:
    print('Yes')
else :
    print('No')

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

if h <= sum(list_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()))
t = 0
for i in range(N):
    H -= A[i]
    if H <= 0:
        break
    else:
        t += 1
if t < N:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
"""
raccoon has no time limit, so will be able to use all his moves once
so just sum up the damage of each move, if greater or equal to H
then he wins
"""


def can_raccoon_win(H, A):
  if sum(A) >= H:
    return "Yes"
  return "No"
  

if __name__ == "__main__":
  H = int(input().split()[0])
  A = map(int, input().split())
  print(can_raccoon_win(H, A))

Solution (Python):



s = [input() for i in range(2)]
HN = (list(s[0].split()))
A = (list(s[1].split()))


sum_a = 0
for i in range(int(HN[1])):
  sum_a = sum_a +int(A[i])
  

if int(sum_a) >= int(HN[0]):
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
list1 = input().split(' ')
list2 = input().split(' ')
list2 =  [int(s) for s in list2]

num = int(list1[1])
HP = int(list1[0])
D = 0
for N in list2:
  D += N

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

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

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

Solution (Python):
H,N = map(int,input().split())
A = [int(x) for x in input().split()]
for xg in A:
    H=H-xg
if H > 0:
    print('No')
elif H <= 0:
    print('Yes')

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

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

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

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

Solution (Python):
sumDmg = 0
firstLine = input().split()
secondLine = input().split()
for n in range(len(secondLine)):
  sumDmg = sumDmg + int(secondLine[n])
if sumDmg >= int(firstLine[0]):
  print("Yes")
else:
  print("No")

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

m = [i for i in input().split()]

result = 0

for i in m:
    result += int(i)

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

Solution (Python):
ipt=input().split()
hp=int(ipt[0])
syurui=int(ipt[1])
tech=input().split()
for i in tech:
  atk=int(i)
  hp-=atk
if hp<=0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
a,b = map(int,input().split())
L = list(map(int,input().split()))
L.sort()
if b == 0:
    print("No")
    exit()
if b==1 and L[0]<a:
    print("No")
    exit()

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

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




if sum(s2) >= int(s[0]):
    print("Yes")
else:
    print("No")

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

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

moves = list(map(int, input().split()))[::-1]

if sum(moves[:N]) >= 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 = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")

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

for a in A:
    H -= a

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

Solution (Python):
from itertools import permutations, combinations

nums = input().split()
As = input().split()
H = nums[0]
N = nums[1]
A = []

sum = 0

for B in As:
    sum = sum + int(B)

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

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

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

Solution (Python):
in_len = input().split(" ")

in_h = int(in_len[0])
in_n = int(in_len[1])
in_a = input().split(" ")

for i in range(in_n):
  in_h -= int(in_a[i])

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

Solution (Python):
H,N = map(int,input().split())
A = input().split()
num_A = 0
for i in A:
    A_i = int(i)
    num_A += A_i
if num_A >= H: print ('Yes')
else: print ('No')

Solution (Python):
firstinput = input("")
secondinput = input("")
firstinputsplit = firstinput.split(" ")
secondinputsplit = secondinput.split(" ")
H = int(firstinputsplit[0])
N = int(firstinputsplit[1])
firstcont = H <= 1000000000 and N <= 1000000
skill = 0
exe = 0
for i in secondinputsplit:
    skill = skill + int(i)
    exe = exe + 1
if firstcont == True and exe == len(secondinputsplit):
  if H <= skill:
    print("Yes")
  else:
    print("No")
else:
  print(H)

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

Solution (Python):
a,b=map(int,input().split())
c=[int(x) for x in input().split()]

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

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

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

print(ans)

Solution (Python):
h, n = input().split()
h = int(h)
n = int(n)
attack = sorted(list(map(int, input().split())), reverse=True)
while  n > 0:
    m_attack = attack[0]
    if h - m_attack <= 0:
        h = h - m_attack
        print("Yes")
        break
    else:   
        h = h - m_attack
        attack.remove(m_attack)
        n = n-1
if h > 0:
    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())
AList = list(map(int, input().split()))

for A in AList:
    H = H - A
    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()))	

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

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

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

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
a = sorted(a)
if n == 1:
    if a[0] >= h:
        print('Yes')
    else:
        print('No')

elif sum(a) >= 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):
H, N = map(int, input().rstrip().split())
As = [int(x) for x in input().rstrip().split()]
total_attack = sum(As)
if H > total_attack:
    print('No')
else:
    print('Yes')

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

Solution (Python):
H,N = list(map(int,input().split()))
R = list(map(int,input().split()))
if H <= sum(R):
    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):
import math
H,N = map(int,input().split())
A = [int(x) for x in input().split()]

count = 0
sum2 = []
'''for i in range(2 ** N):
        sum1 = []
        for j in range(len(A)):
            if ( i >> j) & 1 == 1:
                sum1.append(A[j])
        if sum(sum1) == H:
            count = 1
            print("Yes")
            break
'''
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())) 
 
for i in range(N):
    H -= A[i]
 
if H <= 0 :
    print('Yes')
else:
    print('No')

Solution (Python):
_input = input().split()

hp = int(_input[0])
n = int(_input[1])

_input_attack = input().split()

check = 0
for i in range(n):
  check += int(_input_attack[i])
  
if hp <= check:
  print('Yes')
else:
  print('No')

Solution (Python):

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

result=""
i=0

for i in range(N):
    H-=InpList[i]
    
if H>0:
    result="No"
else:
    result="Yes"

print(result)

Solution (Python):

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

sumA = 0

for n in range(N):
    sumA = sumA + A[n-1]

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

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=input().split()
hh=int(h)
nn=int(n)
s=0

a = list(map(int, input().split()))
for i in a:
    s=s+i

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

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

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

AA = input().split()

totalA = 0
for i in range(N):
  totalA += int(AA[i])

result = ""
if H <= totalA:
  result = "Yes"
else:
  result = "No"

print(result)

Solution (Python):
a = []
a = input().split()
H = int(a[0])
N = int(a[1])
A = input().split()
A = [int(i) for i in A]











T = sum(A)
H = H - T


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

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

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

atc = 0

for n in range(N):
    atc += A[n]

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

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

Solution (Python):
import os
import sys

def main():
    H , A = map(int , input().split())
    list = [s for s in input().split()]
    c = sum(int(i) for i in list)
    if c >= H :
        print ('Yes')
    else :
        print ('No')
    

if __name__ == '__main__':
    main()

Solution (Python):
input_list = list(map(int, input().split()))
hp = input_list[0]
arts = input_list[1]
arts_list = list(map(int, input().split()))
if hp <= sum(arts_list):
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

if(H <= sum(aa)):
	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()))
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()))
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('Yes')
else:
    print('No')

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

t = 0

for i in A:
    t += i

else:
    if H <= t:
        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()]
  
if h <= sum((a_list)):
  print("Yes")
else:
  print("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,m = map(int, input().split())
atack = list(map(int, input().split()))

atack.sort(reverse=True) 
atack_select = atack[:m]

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

Solution (Python):

def abc153_b():
    H,N=map(int,input().split())
    A=list(map(int,input().split()))
    attack=0
    for a in A:
        if attack>=H:
            print("Yes")
            return
        else:
            attack+=a
    if attack >= H:
        print("Yes")
        return
    else:
        print("No")
        return
        
abc153_b()

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

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

Solution (Python):

HP_variation = list(map(int,input().split()))
skill_damage = list(map(int,input().split()))

if HP_variation[0] <= sum(skill_damage):
    print("Yes")
else:
    print("No")

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

m = [i for i in input().split()]

result = 0

for i in m:
    result += int(i)

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

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

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

list.sort(A, reverse=True)

for i in range(N):
    para = para - A[i]
    if para <= 0 :
        print('Yes')
        break
    elif i ==N - 1  and para > 0:
         print('No')

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

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

Solution (Python):
def main():
    h, _ = map(int, input().split())
    specials = list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

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

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

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

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

m = [i for i in input().split()]

result = 0

for i in m:
    result += int(i)

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

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
l = len(A)
q = 0
'''
print(A)
print(l)
'''
for damage in A:
  q = q+damage

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

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

for i in range(0, N):
    H = H - A[i]
    if H < 0:
        break

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

Solution (Python):

prm = input().split()
hp = int(prm[0])
ult = int(prm[1])


dmg = input().split()
alldmg = 0

for cdmg in dmg:
    alldmg += int(cdmg)

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

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

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

for v in a:
    h -= v
if h > 0:
    print("No")
else:
    print("Yes")

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

A_sorted = sorted(A, reverse=True)


for attack in A_sorted:
	if N == 0:
		break
	H = H - attack
	N = N - 1

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

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

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

A_list = [N]
A_list = input().split()

for i in range(N):
    H = H - int(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(" ")))
atk = 0
for i in A:
    atk += i
if atk >= H:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a = input()
l = a.split()
h = int(l[0])
n = int(l[1])
b = input()
ll = b.split()
for i in range(0,n):
    ll[i] = int(ll[i])

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