Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
A = [chr(ord('A') + i) for i in range(26)]
for i in range(len(S)):
    res = A.index(S[i]) + N
    if res > 25:
        res -= 25
    print(A[res], end = '')

Fixed submission:
N = int(input())
S = input()
A = [chr(ord('A') + i) for i in range(26)]
for i in range(len(S)):
    res = A.index(S[i]) + N
    if res >= 26:
        res -= 26
    print(A[res], end = '')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
B = list()
for i in range(N):
    for j in range(N):
        if A[j] == i + 1:
            B.append(j + 1)
for k in range(N):
    print(str(B[k]) + ' ', end = '')


Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0] * N

for i in range(0, N):
    B[A[i] - 1] = i + 1
for i in range(0, N):
    print(str(B[i]) + ' ', end = '')
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
A = list(map(int, input().split()))
while M > 0:
    M -= 1
    A[A.index(max(A))] //= 2
print(sum(A))


Fixed submission:
import heapq

n, m = map(int, input().split())
a = list(map(lambda x: int(x)*(-1), input().split()))
heapq.heapify(a)  # aを優先度付きキューに

for _ in range(m):
    tmp_min = heapq.heappop(a)
    heapq.heappush(a, (-1)*(-tmp_min//2))  # 計算誤差の関係で-1を2回かけてます
print(-sum(a))

Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse = True)
while M > 0:
    M -= 1
    A[0] //= 2
    A.sort(reverse = True)
print(sum(A))


Fixed submission:
import heapq

n, m = map(int, input().split())
a = list(map(lambda x: int(x)*(-1), input().split()))
heapq.heapify(a)  # aを優先度付きキューに

for _ in range(m):
    tmp_min = heapq.heappop(a)
    heapq.heappush(a, (-1)*(-tmp_min//2))  # 計算誤差の関係で-1を2回かけてます
print(-sum(a))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
res = 0
for i in range(N):
    res += i
print(res)


Fixed submission:
N = int(input())
res = int(N * (N - 1)//2)
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []
t = 0
for i in range(N):
    A.append(int(input()))
while t != N:
    B = [0] * N
    for i in range(N):
        if t != i:
            B[i] = A[i]
    print(max(B))
    t += 1


Fixed submission:
N = int(input())
A = []
B = [0] * N
for i in range(N):
    A.append(int(input()))
max = max(A)
B = sorted(A, reverse = True)
count = A.count(max)
if count > 1:
    for i in range(N):
        print(max)
else:
    for i in range(N):
        if A[i] != max:
            print(max)
        else:
            print(B[1])
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
    L[i], R[i] = map(int, input().split())
for i in range(N):
    clear = 0
    for j in range(M):
        if L[j] <= i + 1 <= R[j]:
            clear += 1
        else:
            break
    if clear == M:
        count += 1
print(count)


Fixed submission:
N, M = map(int, input().split())
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
    L[i], R[i] = map(int, input().split())
Lmax = max(L)
Rmin = min(R)
if Lmax <= Rmin:
    print(Rmin - Lmax + 1)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
N = [int(i) for i in input().split]
A = [int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Fixed submission:
N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Buggy python submission (verdict: Runtime Error):
N = list[int(i) for i in input().split]
A = list[int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Fixed submission:
N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Buggy python submission (verdict: Runtime Error):
N = list[int(i) for i in input().split]
A = list[int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    print(even)
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Fixed submission:
N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())

if b%a==0:
    print(a+b)
else:
    print(b-a)


Fixed submission:
a,b=(int(x) for x in input().split())
if b%a==0:
    print(a+b)
else:
    print(b-a)
Buggy python submission (verdict: Runtime Error):
def contest(N, str):
    count = {}

    for s in str:
        if s not in count:
            count[s] = 1

        else:
            count[s] +=  1
    
    ret = sorted(count.items(),key=lambda count: count[1], reverse=True)
    maxnum = ret[0][1]
    
    retVal = []

    for r in ret:
        if r[1] == maxnum:
            retVal.append(r[0])
            
        else:
            break

    result = '\n'.join(sorted(retVal))

    return result


if __name__ == "__main__":
    N = int(input())
    S = []

    for i in range(N):
        S.append(input())

    print(contest(N, str))


Fixed submission:
def contest(N, str):
    count = {}

    for s in str:
        if s not in count:
            count[s] = 1

        else:
            count[s] +=  1
    
    ret = sorted(count.items(),key=lambda count: count[1], reverse=True)
    maxnum = ret[0][1]
    
    retVal = []

    for r in ret:
        if r[1] == maxnum:
            retVal.append(r[0])
            
        else:
            break

    result = '\n'.join(sorted(retVal))

    return result


if __name__ == "__main__":
    N = int(input())
    S = []

    for i in range(N):
        S.append(input())

    print(contest(N, S))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
for _ in range(N):
    tmp = input()
    S.append(tmp)

S_unique = set(S)

a = {}
for s in S_unique:
    a[s] = S.count(s)    


maxval = max(a.values())

anss = []
for s in a:
    if a[s] == maxval:
        anss.append(s)

anss = sorted(anss)

for a in anss:
    print(a)



Fixed submission:
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    tmp = input()
    S.append(tmp)

counter = Counter(S)
c_most = counter.most_common()

# a = {}
# for s in S_unique:
#     a[s] = S.count(s)

maxval = c_most[0][1]

anss = []

for s in c_most:
    if s[1] == maxval:
        anss.append(s[0])
    else:
        break

anss = sorted(anss)

for a in anss:
    print(a)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int,input().split())
p = list(map(int,input().split()))

exp = [(x+1)*0.5 for x in p]

summed = []
for i in range(N-K+1):
    summed.append(sum(exp[i:i+K]))

print(max(summed))

Fixed submission:
N, K = map(int,input().split())
p = list(map(int,input().split()))

exp = [(x+1)*0.5 for x in p]

sums = []
sums.append(0.0)
for i in range(1,N+1):
    sums.append(sums[i-1]+exp[i-1])

#print(sums)
ans = 0.0
for i in range(N-K+1):
    if ans < sums[i+K] - sums[i]: ans = sums[i+K] - sums[i];

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
H,N = map(int,input().split())

A = []
B = []
for _ in range(N):
    i1,i2 = map(int,input().split())
    A.append(i1)
    B.append(i2)


# HPが0のとき
dp = {}
# 全てコスト無限大としておく
for hp in range(H+1):
    dp[hp] = float('inf')

dp[H] = 0
for hp in range(H,-1,-1):
    # 遷移 = 魔法を1つ使う
    for i in range(N):
        # 遷移先
        hp_next = hp - A[i]
        if hp_next < 0: hp_next = 0
        # 遷移先のコスト
        mp_next = dp[hp] + B[i]
        

        dp[hp_next] = min(dp[hp_next],mp_next)

print(dp[0])

Fixed submission:
H,N = map(int,input().split())

A = []
B = []
for _ in range(N):
    i1,i2 = map(int,input().split())
    A.append(i1)
    B.append(i2)


# HPが0のとき
dp = {}
# 全てコスト無限大としておく
for hp in range(H+1):
    dp[hp] = float('inf')

dp[H] = 0
for hp in range(H,-1,-1):
    # 遷移 = 魔法を1つ使う
    for i in range(N):
        # 遷移先
        hp_next = hp - A[i]
        if hp_next < 0: hp_next = 0
        # 遷移先のコスト
        mp_next = dp[hp] + B[i]
        

        dp[hp_next] = min(dp[hp_next],mp_next)

print(dp[0])
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int,input().split()))

# for i in range(1,N):
#     # print(P[i],P[i+1])
#     if P[i-1] <= P[i]:
#         print(i+1)
#         exit()

# print(N)

ans = 0

# 各部分列の最小値
minval = max(P)
for i in range(N):
    # arr = P[0],...,P[i]の最小値
    minval = min(minval,P[i])
    arr = P[0:i+1]

    # P[i]が最小値以下なら
    if P[i] <= minval:
        ans += 1
    
print(ans)


Fixed submission:
N = int(input())
P = list(map(int,input().split()))

ans = 0

# 各部分列の最小値
minval = max(P)
# for i in range(N):
for x in P:
    # arr = P[0],...,P[i]の最小値
    minval = min(minval,x)

    # P[i]が最小値以下なら
    if x <= minval:
        ans += 1
    
print(ans)
Buggy python submission (verdict: Runtime Error):
import math

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

# 最小公約数
gcd = math.gcd(A,B)
# 最小公倍数
lcm = int(A*B/gcd)
print(lcm)

Fixed submission:
import fractions

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

# 最小公約数
gcd = fractions.gcd(A,B)
# 最小公倍数
lcm = int(A*B/gcd)
print(lcm)
Buggy python submission (verdict: Runtime Error):
D = input
msg = 'Christmas'
ev = ' Eve'
dic = {'22':msg+ev*3, '23':msg+ev*2, '24':msg+ev, '25':msg}
print(dic[str(D)])

Fixed submission:
D = input()
dic = {'22':'Christmas Eve Eve Eve', '23':'Christmas Eve Eve', '24':'Christmas Eve', '25':'Christmas'}
print(dic[str(D)])
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = [input() for _ in range(N)]

T = sorted(list(set(S)))
U = [S.count(T[i]) for i in range(len(T))]

for i in range(len(T)):
    if S.count(T[i]) == max(U):
        print(T[i])

Fixed submission:
n = set(map(int, input().split()))
if len(n) == 2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = [input() for _ in range(N)]

T = sorted(list(set(S)))
U = [S.count(T[i]) for i in range(len(T))]

for i in range(len(T)):
    if S.count(T[i]) == max(U):
        print(T[i])


Fixed submission:
n = set(map(int, input().split()))
if len(n) == 2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = [input() for _ in range(N)]

T = set(S)
U = list(T)
V = [S.count(U[i]) for i in range(len(T))]

for i in range(len(T)):
    if S.count(U[i]) != max(V):
        U[i] = ''

for i in range(len(T)):
    if U[i] != '':
        print(U[i])

Fixed submission:
n = set(map(int, input().split()))
if len(n) == 2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import math
A, B, C = map(int, input().split())
if math.gcd(A, math.gcd(B, C)) == max(A, B, C):
    print('No')
else:
    print('Yes')

Fixed submission:
n = set(map(int, input().split()))
if len(n) == 2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
X = [int(x) for x in input().split()]
result = []
sum = 0
goal = round(mean(X))
for i in range(len(X)):
    sum += (X[i] - goal) ** 2
print(sum)


Fixed submission:
from statistics import mean
N = int(input())
X = input().split()
for i in range(len(X)):
    X[i] = int(X[i])
goal = round(mean(X)) 
sum = 0
for i in range(len(X)):
    sum += (X[i] - goal) ** 2
print(sum)
Buggy python submission (verdict: Runtime Error):
N  = int(input())
s = [float(i) for i in range(1,N + 1)]
cnt =0.0
for i in s:
    if i % 2 != 0:
        cnt += 1
print(float(cnt/tmp))

Fixed submission:
N  = int(input())
s = [float(i) for i in range(1,N + 1)]
cnt =0.0
for i in s:
    if i % 2 != 0:
        cnt += 1
tmp = float(len(s))
print(float(cnt/tmp))
Buggy python submission (verdict: Runtime Error):
a= map(int, input().split())
s = input()
if 3200 <= a:
    print(s)
else:
    print('red')

Fixed submission:
a= int(input())
s = input()
if 3200 <= a:
    print(s)
else:
    print('red')

Buggy python submission (verdict: Runtime Error):
a= map(int, input().split())
s = input()
if a <= 3200:
    print(s)
else:
    print('red')

Fixed submission:
a= int(input())
s = input()
if 3200 <= a:
    print(s)
else:
    print('red')
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = True
for i in range(1,len(H)):
    if (H[i-1] - H[i]) == 1:
        H[i-1] -= 1
    elif (H[i-1] - H[i]) <= 0:
        continue
    else:
        ans = False
        break
H.reverse()
for i in range(1,len(H)):
    if H[i-1]-H[i] >=  0:
        pass
    else:
        ans = False
        break
if ans:
    print("Yes")
else:
    print("No")

Fixed submission:
A,B,C = map(int,input().split())
s = A - B
test = C - s
if test <=  0:
    test = 0
print(test)
Buggy python submission (verdict: Runtime Error):
w,h,x,y = map(int,int.split())
flag = 0
if (x/W)==(y/W):
  flag = 1
print((w*h)/2,flag)


Fixed submission:
w,h,x,y = map(int,input().split())
flag = 0
if ((x/w) ==0.5) and ((y/h) == 0.5):
  flag = 1
print((w*h)/2,flag)
Buggy python submission (verdict: Runtime Error):
import itertools
a= list(map(int, input().split()))
result = []
test = list(itertools.permutations(a, 2))
for i in range(test):
    result.append(test[i][0] + test[i][1])
print(min(result))

Fixed submission:
import itertools
a= list(map(int, input().split()))
result = []
test = list(itertools.permutations(a, 2))
for i in range(len(test)):
    result.append(test[i][0] + test[i][1])
print(min(result))
Buggy python submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Fixed submission:
a, b = map(int, input().split()) 
print((3*a + b) // 2)

Buggy python submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Fixed submission:
a, b = map(int, input().split()) 
print((3*a + b) // 2)

Buggy python submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities = cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Fixed submission:
a, b = map(int, input().split()) 
print((3*a + b) // 2)

Buggy python submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Fixed submission:
a, b = map(int, input().split()) 
print((3*a + b) // 2)
Buggy python submission (verdict: Runtime Error):
N = int(input())
num = list(map(int, input().split()))
tmp = 0
state_tmp = 0
result = 1
#i番目を比べる
for i in range(N):
    if i != 0 and 1<= num[i] <= 200:
        for j in range(N):
            if num[j] <= num[i]:
                state_tmp +=1
        if state_tmp ==  N and tmp <= num[i]:
                result +=1
        tmp = num[i]
        state_tmp = 0
    else:
        tmp = num[i]
    
print(result)

Fixed submission:
import itertools
num = list(map(int, input().split()))
result = 0
tmp_1 = 0
tmp  =0
tmp_2 = 0
if num[0] == num[1]:
    tmp  = num[0] +  num[0]
else:
    tmp = num[0] + num[1]
    tmp_1 = num[0] + num[0] -1
    tmp_2 = num[1] + num[1] -1
print(max(tmp,tmp_1,tmp_2))
Buggy python submission (verdict: Runtime Error):
import itertools
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
seq = (a,b,c,d,e)
data = list(itertools.combinations(seq,2))
print(data)
result = 0
for i in range(len(data)):
    if data[i][0] < data[i][1]:
        if data[i][1] - data[i][0] < k:
        result +=1
    else:
        if data[i][0] - data[i][1] < k:
        result +=1
if result == len(data):
    print('Yay!')
else:
    print(':(')




Fixed submission:
import itertools
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
seq = (a,b,c,d,e)
data = list(itertools.combinations(seq,2))
result = 0
for i in range(len(data)):
    if data[i][0] < data[i][1]:
        if data[i][1] - data[i][0] <= k:
            result +=1
    else:
        if data[i][0] - data[i][1] <= k:
            result +=1
if result == len(data):
    print('Yay!')
else:
    print(':(')

Buggy python submission (verdict: Runtime Error):
import itertools
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
seq = (a,b,c,d,e,f)
data = list(itertools.combinations(seq,2))
result = 0
for i in range(len(data)):
    if data[i][0] - data[i][1] < k:
        result +=1
if result == len(data):
    print('Yay!')
else:
    print(':(')




Fixed submission:
import itertools
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
seq = (a,b,c,d,e)
data = list(itertools.combinations(seq,2))
result = 0
for i in range(len(data)):
    if data[i][0] < data[i][1]:
        if data[i][1] - data[i][0] <= k:
            result +=1
    else:
        if data[i][0] - data[i][1] <= k:
            result +=1
if result == len(data):
    print('Yay!')
else:
    print(':(')
Buggy python submission (verdict: Runtime Error):
N=input();print('DENIED'if any([x%2==0 and(x%3andx%5)for x in map(int,input().split())])else'APPROVED')

Fixed submission:
import sys
N = int(input())
A = [int(i) for i in input().split()]
for i in A:
  if i%2 == 0 and (not i%3 == 0 and not i % 5 == 0):
    print("DENIED")
    sys.exit()
  else :
    continue
print("APPROVED")

Buggy python submission (verdict: Runtime Error):
N=int(input())
print('DENIED' if any([x%2==0 and (x%3 and x%5) for x in int(input().split())]) else 'APPROVED')

Fixed submission:
import sys
N = int(input())
A = [int(i) for i in input().split()]
for i in A:
  if i%2 == 0 and (not i%3 == 0 and not i % 5 == 0):
    print("DENIED")
    sys.exit()
  else :
    continue
print("APPROVED")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))(A1,A2...AN)
t=0
for i in b:
	if x % 2 ==0 and x % 3 != 0 and x % 5 != 0:
		t=t+1
if t>0:
	print('DENIED')
else:
	print('APPROVED')

Fixed submission:
import sys
N = int(input())
A = [int(i) for i in input().split()]
for i in A:
  if i%2 == 0 and (not i%3 == 0 and not i % 5 == 0):
    print("DENIED")
    sys.exit()
  else :
    continue
print("APPROVED")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))(A1,A2...AN)
t=0
for i in A:
	if x % 2 ==0 and x % 3 != 0 and x % 5 != 0:
		t=t+1
if t>0:
	print('DENIED')
else:
	print('APPROVED')

Fixed submission:
import sys
N = int(input())
A = [int(i) for i in input().split()]
for i in A:
  if i%2 == 0 and (not i%3 == 0 and not i % 5 == 0):
    print("DENIED")
    sys.exit()
  else :
    continue
print("APPROVED")
Buggy python submission (verdict: Runtime Error):
T,S = map(str,input().split())
A,B = map(int,input().split())
U = input()
Z = [A+[0,-1][U == T],B+[0,-1][U == S]]
P = " ".join(Z)
print(P)

    

Fixed submission:
T,S = input().split()
A,B = map(int,input().split())
U = input()
Z = [A+[0,-1][U == T],B+[0,-1][U == S]]
O = map(str,Z)
agy = ' '.join(O)
print(agy)
Buggy python submission (verdict: Runtime Error):
A = input()
B = len(A)
print(x*B)

Fixed submission:
A = input()
B = len(A)
print("x"*B)
Buggy python submission (verdict: Runtime Error):
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
A.sort(reverse = True)
B = max(0,N-(A[0]+A[1]))
if B > 0:
    print("No")
else:
    print("Yes")

Fixed submission:
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
B = max(0,N-sum(A))
if B > 0:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
A.sort(reverse = True)
B = max(0,H-(A[0]+A[1]))
if B > 0:
    print("No")
else:
    print("Yes")


Fixed submission:
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
B = max(0,N-sum(A))
if B > 0:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
if N = M:
    print("Yes")
else:
    print("No")

Fixed submission:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
A = list(str(a)*b,), B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
  if A[i] > B[i]:
  　　　　print(str(B))
         break
  elif B[i] > A[i]:
         print(str(A))
         break

Fixed submission:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A == B :
    print "Yes"
else :
    print "No"
  

Fixed submission:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A = B :
    print "Yes"
else :
    print "No"
  

Fixed submission:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
A = list(str(a)*b,), B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
  if A[i] > B[i]:
  　　　　print(str(B))
         break
  elif B[i] > A[i]:
         print(str(A))
         break

Fixed submission:
a,b = map(int,input().split())
C = min(a,b)
D = max(a,b)
print(str(C)*D)

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
A = list(str(a)*b,) B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
  if A[i] > B[i]:
  　　　　print(str(B))
         break
  elif B[i] > A[i]:
         print(str(A))
         break

Fixed submission:
a,b = map(int,input().split())
C = min(a,b)
D = max(a,b)
print(str(C)*D)

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
A = list(str(a)*b,) B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
  if A[i] > B[i]:
  　　　　print(str(B))
         break
  elif B[i] > A[i]:
         print(str(A))
         break
  

Fixed submission:
a,b = map(int,input().split())
C = min(a,b)
D = max(a,b)
print(str(C)*D)
Buggy python submission (verdict: Runtime Error):
C = input()
print(chr(ord(C)+1)    

Fixed submission:
C = input()
print(chr(ord(C)+1) )
Buggy python submission (verdict: Runtime Error):
K,X =[int(i)for i in input().split()]
if 500K >=X:
  print("Yes")
else :
  print("No")


Fixed submission:
K,X =[int(i)for i in input().split()]
if 500*K >=X:
  print("Yes")
else :
  print("No")