TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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`.

Submission attempts (in order):
n,m=map(int,input().split())
l=list(map(int,input().split())
s=sum(l)
if n<=s:
  print("Yes")
else:
  print("No")

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


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=map(int,input().split())
A=map(int,input().split())
print("Yes" if max(A)>=H else "No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N= map(int, input().split())
An = list(map(int, input().split()))
if sum(An)>= H:
	print('Yes')
else:
	print('No

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n= map(int, input().split())
a = list(map(int, input().strip().split()))
total = sum(a) 
print(total)
if(h>total):
    print('No')
else:
    print('Yes')

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



Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n = list(map(int,input().splii()))
l = list(map(int,input().splii()))

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

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
List=list(map(int,input().split()))
# print(h)
# print(n)
# print(List)
if sum(List)>= h:
    print('YES')
else:
    print('NO')

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N,  = map(int, input().split())

Damage = []
for i in range(1,N+1):
    Ai = map(int, input().split())
    Damage.append(Ai)
Total_Damage = sum(Damage)

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

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


for i in range(1,N+1):
    Damage = []
    Ai = int(input())
    Damage.append(Ai)
Total_Damage = sum(Damage)

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

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

Damage = []
for i in range(1,N+1):
    Ai = int(input())
    Damage.append(Ai)
Total_Damage = sum(Damage)

if H <= Total_Damage:
    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 = int(input())
A_total = sum(A_list)

if A_total >= H:
    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")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
a = list(map(int, input8).split())
sum = sum(a)
if sum >= H:
  print("Yes")
else:
  print("No")

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
import sys,collections,math,random,fractions,bisect;sys.setrecursionlimit(10**7)
sr = sys.stdin.readline; P = print; P2 = lambda x: print(*x, sep="\n")
def I(i=0): t = [int(x)-i for x in sr().split()];return t if len(t) > 1 else t[0]
def S(): t = sr().split(); return t if len(t) > 1 else t[0]
L1,L2,L3,L4, = [],[],[],[]
 
H,N = I()
A = I()
if sum([A]) >= H:
    print("Yes")
else:
    print("No")


import sys,collections,math,random,fractions,bisect;sys.setrecursionlimit(10**7)
sr = sys.stdin.readline; P = print; P2 = lambda x: print(*x, sep="\n")
def I(i=0): t = [int(x)-i for x in sr().split()];return t
def S(): t = sr().split(); return t if len(t) > 1 else t[0]
L1,L2,L3,L4, = [],[],[],[]
 
H,N = I()
A = I()
if sum(A) >= H:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h ,n =map(int,input().split())
a =list(map(int,input().split()))

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
a=input()
list=a.split()
sum=0
for i in range(n-1):
    sum=sum+int(input())
#print(sum)
if sum>=h:
    print("Yes")
else:
    print("No")


h,n=map(int,input().split())
sum=0
for i in range(n):
    a=int(input())
    sum=sum+a
if sum>=h:
    print("yes")
else:
    print("no")

h,n=map(int,input().split())
a=input()
list=a.split()
sum=0
for item in list:
    sum=sum+int(item)
#print(sum)
if sum>=h:
    print("Yes")
else:
    print("No")



Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=map(int,input().split())

sum = 0
1<=H<=10**9
1<=N<=10**5


import random

for i in range(1,N+1):
    attack = random.randint(1,10**5)
    print(attack)

    sum += attack

total = sum

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

h, a = map(int, input().split())
if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)

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

sum = 0
1<=H<=10**9
1<=N<=10**4


import random

for i in range(1,N+1):
    attack = random.randint(1,10**5)
    print(attack)

    sum += attack

total = sum

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

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

1<=H<=10**9
1<=N<=10**5

import random

for i in range(1,N+1):
    print(random.randint(1,10**5))

sum = 0
sum += i

if H - sum < 0:
    print("Yes")
elif H - sum > 0:
    print("No")


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

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

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


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

sum = 0
1<=H<=10**9
1<=N<=10**4


import random

for i in range(1,N+1):
    attack = random.randint(1,10**4)
    print(attack)

    sum += attack

total = sum

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


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

sum = 0
1<=H<=10**9
1<=N<=10**5

import random

for i in range(1,N+1):
    attack = random.randint(1,10**5)
    print(attack)
    sum += attack
    print(sum)

if H - sum < 0:
    print("Yes")
elif H - sum > 0:
    print("No")

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

sum = 0
1<=H<=10**9
1<=N<=10**5


import random

for i in range(1,N+1):
    attack = random.randint(1,10**5)
    print(attack)

    sum += attack

total = sum

if H - total < 0:
    print("Yes")
elif H - total > 0:
    print("No")

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

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

total = sum(attack)

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n = map(int,input().split())
a = list(map(int,input().split()))
sorted(a)
if h <= sum(a[:n-1]):
    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")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
enemy, num = map(int,input().split())
skills = list(map(int,input().split()))
print("Yes") if sum(skills) < enemy else print("No")


enemy, num = input().split()
skills = list(map(input().split()))
print("Yes") if max(skills) >= enemy else print("No")

num = input()
list = list(map(int,input().split()))
list2 = set(list) 
print("No") if len(list) == len(list2) else print("Yes")


enemy, num = map(int,input().split())
skills = list(map(int,input().split()))
print("Yes") if sum(skills) >= enemy else print("No")


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import fileinput

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

print(sum(a))

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




import fileinput

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

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




Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = list(map(int,input().split))
A = list(map(int,input().split))
s = A[0]
for i in range(1,len(A)):
    s += A[i]
if s>=H:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
i = list(map(int, input().split()))
j = list(map(int, input().split()))
if i[0]<=sum(j):
	print(Yes)
else:
	print(No)

i = list(map(int, input().split()))
j = list(map(int, input().split()))
if i[0]=<sum(j):
  print(Yes)
else:
  print(No)

i = list(map(int, input().split()))
j = list(map(int, input().split()))
sumj=0
for k in range(len(j)):
  sumj+=j[k]
if i[0]<=sumj:
  print(Yes)
else:
  print(No)

i = list(map(int, input().split()))
j = list(map(int, input().split()))
if i[0]<=sum(j):
  print(Yes)
else:
  print(No)

i = list(map(int, input().split()))
j = list(map(int, input().split()))
if i[0]<=sum(j):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
atacks = map(int, input().split())

if sum(atacks) >= H:
  print('YES')
else:
  print('NO')

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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 = list(map(int, input().split()))

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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, _ = map(int, input().split(" "))
print("Yes" if sum(map(int, input().split(" "))) <= H else "No")

H, _ = map(int, input().split(" "))
print("Yes" if sum(map(int, input().split(" "))) >= H else "No")


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=int(input().split())
a = list(map(int,input().split()))
for i in range(n):
  h -= a[i]
if h>0 :
  print("n↨o")
else:
  print("y↨es")
  

h,n=map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
  h -= a[i]
if h>0 :
  print("n↨o")
else:
  print("y↨es")
  


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


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n = list(map(int,input().split()))
a = list(map(int, input().split()))

if(h <= sum(a)):
  ans = "YES"
else:
  ans = "NO"
print(ans)

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int, input().split())
aList=list(map(int, input().split()))
result = h
for a in aList:
  result -= a
return 'Yes' if result <= 0 else 'No'

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


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=[int(i) for i in input().split()]
t=[int(i) for i in input().split()]
if sum(t)>=h:print("yes")
else:print("no")

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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = map(int, input().split())
a = list(map(int, input().split()))

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

import sys
input = sys.stdin.readline

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b=map(int,input().split())
c=int(input())
for i in range(2):
  a-=max(c)
if a<=0:
  print('Yes')
else:
  print('No')


a,b=map(int,input().split())
c=list(map(int,input().split()))
for i in range(b):
  a-=c[i]
if a<=0:
  print('Yes')
else:
  print('No')


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n = map(int,input().split())
a = int().rstrip().split()
c = 0
for b in a:
  c += b
if h > c:
  print('No')
else:
  print('Yes')

h,n = map(int,input().split())
z = input()
a = z.split()
c = 0
for b in a:
  c += int(b)
if h > c:
  print('No')
else:
  print('Yes')


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

for i in A:
    H -= i

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

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=map(int,input().split())
A=map(int,input().split())
B=sum(A)
ans='YES'
if B<H:
  ans='NO'
print(ans)

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



Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = (int(x) for x in input().split())
a = list(map(int,input(),split()))

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

H,N = (int(x) for x in input().split())
a = list(map(int,input().split()))

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


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
import sys

inputs = sys.stdin.readline()
A = sys.stdin.readline()
inputs = inputs.split()
H, N = inputs[0], inputs[1]
A = A.split()

A_sum = 0
for i in range(len(A)):
    A_sum += A[i]

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

import sys

inputs = sys.stdin.readline()
A = sys.stdin.readline()
inputs = inputs.split()
H, N = int(inputs[0]), int(inputs[1])
A = A.split()

A_sum = 0
for i in range(len(A)):
    A_sum += int(A[i])

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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 <=0:
  print('Yes')
else:
  print('No')

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 <=0:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n = map(int,input().split())
a = list(map(int,input().split()))
x = max(a)
a.remove(x)
y = max(a)
print(h,x,y)
if x+y >= h:
         print("Yes")
else:
         print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
list = input().split(" ")
H = int(list[0])
skill = input().split(" ")
skill = [int(i) for i in skill]

a1 = max(skill)
skill.remove(a1)
a2 = max(skill)

if a1 + a2 >= H:
    print("YES")
else:
    print("NO")

list = input().split(" ")
H = int(list[0])
skill = input().split(" ")
skill = [int(i) for i in skill]

a1 = max(skill)
skill.remove(a1)
a2 = max(skill)

if a1 + a2 >= H:
    print("YES")
else:
    print("NO")

list = input().split(" ")
H = int(list[0])
skill = input().split(" ")
skill = [int(i) for i in skill]

sum = 0
for i in skill:
    sum = sum + i

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
z=list(map(int,input().split()))
x=list(map(int,input().split()))
d={}
c=0
for i in x:
       if d.get(i,0)==0:
              c+=i
if c>=z[0]:
       print("YES")
else:
       print("NO")

       


z=list(map(int,input().split()))
x=list(map(int,input().split()))
d={}
c=0
for i in x:
       if d.get(i,0)==0:
              c+=i
if c>=z[0]:
       print("YES")
else:
       print("NO")

       


z=list(map(int,input().split()))
x=list(map(int,input().split()))
d={}
c=0
for i in x:
       if d.get(i,0)==0:
              c+=i
if c>=z[0]:
       print("Yes")
else:
       print("No")

       


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
211 5
31 41 59 26 53


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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
i=list(map(int,input().split()))
j=list(map(int,input().split()))
h=i[0]
a=True
c=0
j.sort()
for b in j:
  c+=b
  if c>=h:
    print("Yes")
print("No")

i=list(map(int,input().split()))
j=list(map(int,input().split()))
h=i[0]
a=True
c=0
j.sort(reverse=True)
for b in j:
  c+=b
  if c>=h:
    print("Yes")
    a=False
if a:
  print("No")

i=list(map(int,input().split()))
j=list(map(int,input().split()))
h=i[0]
a=True
c=0
j.sort(reverse=True)
for b in j:
  c+=b
  if c>=h:
    print("Yes")
    a=False
    break
if a:
  print("No")


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))

SUM = sum(A)
if H > SUM:
    print("NO")
else:
    print("YES")

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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")


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


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

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

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

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

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

tmp = sum(A)
tmp = H-tmp

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
hp = int(input())
hissatsu = int(input())
hissatsuatk = list(map(int, input().split()))

if hp <= sum(hissatsuatk):
    print('YES')
else:
    print('NO')


kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))

if kazu1[0] <= sum(kazu2):
    print('YES')
else:
    print('NO')


kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))

if kazu1[0] <= sum(kazu2):
    print('YES')
else:
    print('NO')


kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))

if kazu1[0] <= sum(kazu2):
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b = map(int, input().split())
c = map(int, input().split())
if a <= c.sum():
  print('Yes')
else:"
  print('No')

a, b = map(int, input().split())
c = map(int, input().split())
if a <= c.sum():
  print('Yes')
else:
  print('No')


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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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 = 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()))
if sum(a) >= h:
   print("Yes")
else:
   print("No")


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = (int(x) for x in input().split())
a = list(int(x) for x in input().split())

txt = 'YES' if(sum(a) >= h) else 'NO'
print(txt)


h, n = (int(x) for x in input().split())
a = list(int(x) for x in input().split())

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')


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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
210 5
31 41 59 26 53

H, N = map(int, input().split())
A = list(map(int, input().split()))
atk = 0
for i in A:
    atk += i
if H > atk:
    print("No")
else:
    print("Yes")

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = map(int,input().split())
M = list(map(int,input().split())

ans = 0       
for i in M:
    ans = ans + i
if h > ans:
         print("No)
else:
               print("Yes")
         

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

ans = 0       
for i in M:
  ans = ans + i
if h > ans:
  print("No)
else:
  print("Yes")
         

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

ans = 0       
for i in M:
    ans = ans + i
if h > ans:
    print("No)
else:
    print("Yes")
         

H,N = map(int,input().split())
M = list(map(int,input().split()))
 
ans = 0       
for i in M:
    ans = ans + i
if H > ans:
    print("No")
else:
    print("Yes")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
r=input().split()
H=int(r[0])
N=int(r[1])
data_pre=input().split()
data=[int(s) for s in data_pre]
if max(data)>=H:
    print("Yes")
else:
    print("No")

r=input().split()
H=int(r[0])
N=int(r[1])
data_pre=input().split()
data=[int(s) for s in data_pre]
if sum(data)>=H:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
HP, n = map(int, input().split())
damege = list(input().split())
if sum(damege) >= HP:
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = map(int, input().split())
a = [int(input()) for _ in range(n)]
s = sum(a)
if s >= 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")

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
# 153_b

import random

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

if (1 <= H, H <= 10 ** 9) and (1 <= N, N <= 10 ** 5):
    skill = random.randint(0, N - 1)
    h = H - A[skill]
    h2 = h - A[skill]
    if h <= 0 or h2 <= 0:
        print('Yes')
    elif h > 0 or h2 > 0:
        print('No')


# 153_b

import random

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

if (1 <= H, H <= 10 ** 9) and (1 <= N, N <= 10 ** 5):
    for j in range(len(A)):
        H -= A[j]
    if H <= 0:
        print('Yes')
    if H > 0:
        print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
a=list(map(int,innput().split()))

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


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

if sum(a)>=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")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = map(int,input().split())
a = [int(s) for s in input().split()]
s = H - sum(a)
if s < 0:
    print("No")
else:
    print("Yes")

H,N = map(int,input().split())
a = [int(s) for s in input().split()]
s = H - sum(a)
if s <= 0:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b = map(int,input().split())
lis = list(map(int,input().split))
c = sum(lis)
print("Yes" if a > c else "No")

a,b = map(int,input().split())
lis = list(map(int,input().split()))
c = sum(lis)
print("No" if a > c else "Yes")

Verdicts: Runtime Error

Accepted