Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
if  N == 7　or N == 5 or N == 3:
  print('YES')
else:
  print('NO')


Fixed submission:
N = int(input())
if  N == 7 or N == 5 or N == 3:
	print('YES')
else:
  	print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input())
if  N == 7　or N == 5 or N == 3:
	print('YES')
else:
  	print('NO')

Fixed submission:
N = int(input())
if  N == 7 or N == 5 or N == 3:
	print('YES')
else:
  	print('NO')
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
k = max(a, b, c)
l = min(a, b, c)

print(int(k - l)

Fixed submission:
a,b,c=sorted(map(int,input().split()));print(c-a)
Buggy python submission (verdict: Runtime Error):
import math
N = input()
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(2, N))

Fixed submission:
import fractions
N = int(input())
def lcm(x, y):
    return (x * y) / fractions.gcd(x, y)

print(int(lcm(2, N)))

Buggy python submission (verdict: Runtime Error):
import fractions
N = input()
k = fractions.gcd(2, N)
print(2*N / k)

Fixed submission:
import fractions
N = int(input())
def lcm(x, y):
    return (x * y) / fractions.gcd(x, y)

print(int(lcm(2, N)))

Buggy python submission (verdict: Runtime Error):
import fractions
N = input()
k = fraction.gcd(2, N)
print(2*N / k)

Fixed submission:
import fractions
N = int(input())
def lcm(x, y):
    return (x * y) / fractions.gcd(x, y)

print(int(lcm(2, N)))

Buggy python submission (verdict: Runtime Error):
import fraction
N = input()
k = fraction.gcd(2, N)
print(2*N / k)

Fixed submission:
import fractions
N = int(input())
def lcm(x, y):
    return (x * y) / fractions.gcd(x, y)

print(int(lcm(2, N)))
Buggy python submission (verdict: Runtime Error):
[a, b, c, d] = input()  # 3文字の文字列
list = [a, b, c, d] 
k = 0
for f in list:
    if f = '+':
        k += 1
    else:
        k -= 1    
print(k)  

Fixed submission:
S = input()
print(S.count("+") - S.count('-'))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = a + b
d = a - b
e = a * b
print(max([c, d. e]))

Fixed submission:
a, b = map(int, input().split())
print(max(a+b,a-b,a*b))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = a+b
d = a-b
e = a*b
print(max([c, d. e]))

Fixed submission:
a, b = map(int, input().split())
print(max(a+b,a-b,a*b))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = a+b
d = a-b
e = a*b
print(max(c, d. e))

Fixed submission:
a, b = map(int, input().split())
print(max(a+b,a-b,a*b))
Buggy python submission (verdict: Runtime Error):
M,D = input().strip().split()
count = 0
for m in range(2,M+1):
    for d in range(22, D+1):
        if m = (d / 10) % 10 * (d % 10):
            count += 1
print(count)


Fixed submission:
M,D = list(map(int, input().strip().split()))
count = 0
for m in range(2,M+1):
    for d in range(11, D+1):
        if ((d%10) >= 2) and (int(d/10) >= 2) and (m == int(d/10) * (d%10)):
            count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
M,D = input().strip().split()
count = 0
for m in range(2,M+1):
    for d in range(22, D+1):
      if m = (d / 10) % 10 * (d % 10):
        count += 1
print(count)


Fixed submission:
M,D = list(map(int, input().strip().split()))
count = 0
for m in range(2,M+1):
    for d in range(11, D+1):
        if ((d%10) >= 2) and (int(d/10) >= 2) and (m == int(d/10) * (d%10)):
            count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
_, *intersection = map(int, input().split(' '))
intersection = set(intersection)
for _ in range(1, n):
    _, *newlist = map(int, input().split(' '))
    intersection = intersection & set(newlist)
print(len(intersection))

Fixed submission:
a, b = map(int, input().split())
print(a + b if b % a == 0 else b - a)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
cnt = 0
while s.count('BW') > 0:
    cnt += s.count('BW')
    s = s.replace('BW', 'WB')
print(cnt)

Fixed submission:
S = input()
cnt = 0
for i, s in enumerate(S):
    if s == 'W':
        cnt += i;
cnt -= S.count('W') * (S.count('W') - 1) // 2
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
price = [int(input()) for _ in range(n)]
print(int(sum(price) - max(price) / 2))

Fixed submission:
d = int(input())
s = 'Christmas' + ' Eve' * (25 - d)
print(s)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
a, b = [0] * m, [0] * m
for i in range(m):
    a[i], b[i] = map(int, input().split())
bridge = []
for i in range(m):
    bridge.append(list(range(a[i], b[i])))
cnt = 0

while True:
    cnt_passed = [0] * (n - 1)
    for bri in bridge:
        for j in bri:
            cnt_passed[j - 1] += 1
    removed = cnt_passed.index(max(cnt_passed)) + 1
    for bri in bridge[:]:
        if removed in bri:
            bridge.remove(bri)
    cnt += 1
    if len(bridge) == 0:
        print(cnt)
        exit(0)

Fixed submission:
a = list(map(int, input().split()))
print(max(a) - min(a))
Buggy python submission (verdict: Runtime Error):
from math import sqrt
n = int(input())
m = int(sqrt(n))
li = list(range(m + 1))
#0と1は考えない
for i in range(2, m + 1):
    while li[i] < n:
        li[i] *= i
    li[i] = int(li[i] / i)
print(max(li))

Fixed submission:
a, b, c, d = map(int, input().split())
print('Yes' if abs(a - c) <= d or (abs(a - b) <= d and abs(b - c) <= d) else 'No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input().split()
num = [int(x) for x in S]
flag = True

for i in range(0, N):
    for j in range(i, N):
        if num[i] - num[j] >= 2:
            flag = False
            break
    else:
        continue
    break


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

Fixed submission:
N = int(input())
num = [int(x) for x in input().split()]

if N == 1:
    print("Yes")
elif N == 2:
    if num[0] - num[1] < 2:
        print("Yes")
    else:
        print("No")
else:
    flag = True
    for i in range(N - 2, 0, -1):
        diff = num[i] - num[i + 1]
        if diff <= 0:
            pass
        elif diff == 1:
            num[i] -= 1
        else:
            flag = False
            break
    print("Yes" if flag else "No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

A = []

for i in range(0, N):
    A.append(int(input()))

for i in range(0, N):
    print(max(A[0:i] + A[i+1:N]))

Fixed submission:
N = int(input())

A = []

for i in range(0, N):
    A.append(int(input()))

max1 = sorted(A)[-1]
max2 = sorted(A)[-2]


for i in A:
    if i == max1:
        print(max2)
    else:
        print(max1)
Buggy python submission (verdict: Runtime Error):
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

ans = 0

for k in range(min(d), d[(n // 2) + 1]):
    idx = bisect.bisect_left(d, k)
    if idx == n // 2:
        ans += 1

print(ans)

Fixed submission:
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

print(d[(n // 2)] - d[(n // 2) - 1])

"""
for k in range(d[n // 2], d[(n // 2) + 1]):
    if bisect.bisect_left(d, k) == n // 2:
        ans += 1
"""

Buggy python submission (verdict: Runtime Error):
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

ans = 0

for k in range(min(d), d[(n // 2) + 1]):
    idx = bisect.bisect_left(d, k)
    abc_num = idx
    arc_num = n - abc_num
    if arc_num == abc_num:
        ans += 1

print(ans)

Fixed submission:
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

print(d[(n // 2)] - d[(n // 2) - 1])

"""
for k in range(d[n // 2], d[(n // 2) + 1]):
    if bisect.bisect_left(d, k) == n // 2:
        ans += 1
"""

Buggy python submission (verdict: Runtime Error):
n = int(input())
d = list(int(x) for x in input().split())
d.sort()

ans = 0

for k in range(min(d), d[(n // 2) + 1]):
    arc_num = 0
    abc_num = 0
    
    for i in range(n):
        if d[i] >= k:
            break
        else:
            abc_num += 1
    arc_num = n - abc_num
    if arc_num == abc_num:
        ans += 1

print(ans)

Fixed submission:
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

print(d[(n // 2)] - d[(n // 2) - 1])

"""
for k in range(d[n // 2], d[(n // 2) + 1]):
    if bisect.bisect_left(d, k) == n // 2:
        ans += 1
"""

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
d = list(int(x) for x in input().split())

ans = 0

for k in range(1, max(d) + 1):
    arc_num = 0
    abc_num = 0
    for i in range(n):
        if d[i] >= k:
            arc_num += 1
        else:
            abc_num += 1
    if arc_num == abc_num:
        ans += 1

print(ans)

Fixed submission:
import bisect

n = int(input())
d = list(int(x) for x in input().split())
d.sort()

print(d[(n // 2)] - d[(n // 2) - 1])

"""
for k in range(d[n // 2], d[(n // 2) + 1]):
    if bisect.bisect_left(d, k) == n // 2:
        ans += 1
"""
Buggy python submission (verdict: Runtime Error):
a, b = input().strip()
print(a,b)

Fixed submission:
M, D = input().split()
count = 0

for m in range(4, int(M)+1):
  for d in range(22, int(D)+1):
    d10 = int(str(d)[0])
    d1 = int(str(d)[1])
    if d10>=2 and d1>=2 and d10*d1==m:
      count+=1
      
print(count)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
A = list(input().split())

#for i in range(1,K+1):
#    B = B + A
#print(B)
# Tentousuu
cnt = 0
for i in range(0 , N*K):
    for j in range(i, N*K):
        if (A[(i%N)] > A[(j%N)]):
            cnt = cnt + 1
#print('t=' + str(cnt))
print(cnt%(10**9+7))


Fixed submission:
M, D = map(int, input().split())

cnt = 0
for m in range(1, M+1):
    for d in range(20, D+1):
        d1 = d % 10
        d10 = d // 10
        if (d1 < 2):
            continue
        if (d1 * d10 == m):
#            print(str(m)+'/'+str(d))
            cnt = cnt + 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int, input().split())

sum = 0.0
for x in a:
  sum = sum + 1 / x

print(1/sum)


Fixed submission:
a = int(input())
s = input()

if (a >= 3200):
  print(s)
else:
  print('red')

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int, input().split)

sum = 0.0
for x in a:
  sum = sum + 1 / x

print(1/sum)


Fixed submission:
a = int(input())
s = input()

if (a >= 3200):
  print(s)
else:
  print('red')

Buggy python submission (verdict: Runtime Error):
a = int(input())
s = input()

if (a >= 3200):
  print s
else:
  print('red')


Fixed submission:
a = int(input())
s = input()

if (a >= 3200):
  print(s)
else:
  print('red')

Buggy python submission (verdict: Runtime Error):
a = input()
s = input()

if (a >= 3200):
  print s
else:
  print('red')


Fixed submission:
a = int(input())
s = input()

if (a >= 3200):
  print(s)
else:
  print('red')

Buggy python submission (verdict: Runtime Error):
a = input()
s = input()

print(s if (a >= 3200) else 'red')

Fixed submission:
a = int(input())
s = input()

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

sum = 0.0
for x in n:
  sum = sum + 1/x

print(1/sum)

Fixed submission:
n = int(input())
a = map(int, input().split())

sum = 0.0
for x in a:
  sum = sum + 1 / x

print(1/sum)
Buggy python submission (verdict: Runtime Error):
n = int(input())
v = map(int, input().split())

v.sort()

value = v[0]
for i in range(1, len(v)):
  value = (value + v[i]) / 2

print(value)             
  

Fixed submission:
n = int(input())
v = list(map(int, input().split()))

v.sort()

value = v[0]
for i in range(1, len(v)):
  value = (value + v[i]) / 2

print(value)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s_list=[]
unq_list=[]
count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  s_list.append(s_elem)
  if s_list.count(s_elem) > 1:
    count+=s_list.count(s_elem)-1

print(count)

Fixed submission:
n=int(input())
dic={}

count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  if s_elem in dic:
    count+=dic[s_elem]
    dic[s_elem]+=1
  else:
    dic[s_elem]=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s_list=[]
unq_list=[]
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  s_list.append(s_elem)
  if s_list.count(s_elem) == 2:
    unq_list.append(s_elem)

count=0

for j in range(len(unq_list)):
  match_n=s_list.count(unq_list[j])
  count+=sum(range(1, match_n))

print(count)

Fixed submission:
n=int(input())
dic={}

count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  if s_elem in dic:
    count+=dic[s_elem]
    dic[s_elem]+=1
  else:
    dic[s_elem]=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s_list=[]
u_list=[]
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  s_list.append(s_elem)
  if s_list.count(s_elem) > 1:
    u_list.append(s_elem)

unq_list=list(set(u_list))
count=0

for j in range(len(unq_list)):
  match_n=s_list.count(unq_list[j])
  count+=sum(range(1, match_n))

print(count)

Fixed submission:
n=int(input())
dic={}

count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  if s_elem in dic:
    count+=dic[s_elem]
    dic[s_elem]+=1
  else:
    dic[s_elem]=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s_list=[]

for i in range(n):
  s_elem=''.join(sorted(list(input())))
  s_list.append(s_elem)

unq_list=list(set(s_list))
count=0

for j in range(len(unq_list)):
  match_n=s_list.count(unq_list[j])
  count+=sum(range(1, match_n))

print(count)

Fixed submission:
n=int(input())
dic={}

count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  if s_elem in dic:
    count+=dic[s_elem]
    dic[s_elem]+=1
  else:
    dic[s_elem]=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s_list=[]

for i in range(n):
  s_elem=list(input())
  s_elem=sorted(s_elem)
  s=''.join(s_elem)
  s_list.append(s)

unq_list=list(set(s_list))
count=0

for j in range(len(unq_list)):
  match_n=s_list.count(unq_list[j])
  count+=sum(range(1, match_n))

print(count)

Fixed submission:
n=int(input())
dic={}

count=0
for i in range(n):
  s_elem=''.join(sorted(list(input())))
  if s_elem in dic:
    count+=dic[s_elem]
    dic[s_elem]+=1
  else:
    dic[s_elem]=1

print(count)
Buggy python submission (verdict: Runtime Error):
n=int(input())

count_1=9
count_3=900
count_5=90000

count=0

if n = 100000:
  count+=90909

if 10000 <= n and n < 100000:
  m=n-9999
  count+=m
  count+=909

if 1000 <= n and n < 10000:
  count+=909

if 100 <=n and n < 1000:
  l=n-99
  count+=l
  count+=9

if 10 <= n and n < 100:
  count +=9

if n < 10:
  count+=n

print(count)

Fixed submission:
n=int(input())
 
count=0
 
if n == 100000:
  count+=90909

if 10000 <= n and n < 100000:
  m=n-9999
  count+=m
  count+=909

if 1000 <= n and n < 10000:
  count+=909

if 100 <=n and n < 1000:
  l=n-99
  count+=l
  count+=9

if 10 <= n and n < 100:
  count +=9

if n < 10:
  count+=n

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=[]
max_i=0
max_n=0
for i in range(n):
  a.append(int(input()))
  max_i=a.index(max(a))

max_n=max(a)
a.pop(max_i)
semi_n=max(a)

for j in range(n):
  if j != max_i:
    print(max_n)
  else:
    print(semi_n)


Fixed submission:
n=int(input())
a=[int(input()) for _ in range(n)]

max_i=a.index(max(a))
max_n=max(a)
a.pop(max_i)
semi_n=max(a)

for j in range(n):
  if j != max_i:
    print(max_n)
  else:
    print(semi_n)
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
g=[]
for i in range(m):
  l,r=map(int,input().split())
  g_list=[]
  for j in range(l,r+1):
    g_list.append(j)
  g.append(g_list)

for k in range(m):

  if k == 0:
    unq=set(g[0])
  else:
    unq=unq&set(g[k])

print(len(list(unq)))


Fixed submission:
n,m=map(int,input().split())
l=[]
r=[]
for i in range(m):
  li,ri=map(int,input().split())
  l.append(li)
  r.append(ri)
 
l_max=max(l)
r_min=min(r)
 
if r_min < l_max:
  print(0)
else:
  print(r_min-l_max+1)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
total = 0

while '01' in s or '10' in s:

  s = s.replace('01', 'x').replace('10', 'x')
  total += s.count('x') * 2
  s = s.replace('x', '')
  
print(total)


Fixed submission:
s = input()
total = 0

count_0 = s.count('0') * 2
count_1 = s.count('1') * 2

if count_0 < count_1:
  print(count_0)
else:
  print(count_1)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
total = 0

while '01' in s or '10' in s:
  total += s.count('01') * 2
  s = s.replace('01', '')
  total += s.count('10') * 2
  s = s.replace('10', '')

print(total)


Fixed submission:
s = input()
total = 0

count_0 = s.count('0') * 2
count_1 = s.count('1') * 2

if count_0 < count_1:
  print(count_0)
else:
  print(count_1)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
total = 0

while '01' in s:
  total += s.count('01') * 2
  s = s.replace('01', '')

while '10' in s:
  total += s.count('10') * 2
  s = s.replace('10', '')

print(total)


Fixed submission:
s = input()
total = 0

count_0 = s.count('0') * 2
count_1 = s.count('1') * 2

if count_0 < count_1:
  print(count_0)
else:
  print(count_1)
Buggy python submission (verdict: Runtime Error):
l = list(map(int, input().split))
l.sort()
l.reverse()
l.pop(0)
print(l[0]*l[1]/2)


Fixed submission:
l = list(map(int, input().split()))
l.sort()
l.reverse()
l.pop(0)
print(l[0]*l[1]//2)
Buggy python submission (verdict: Runtime Error):
n=list(input())
k=int(input())
if len(n)==1:
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.append(n.pop(0))
    else:
      break
  if 0<len(one_list)<=k:
    print('1')
  else:
    print(n[0])



Fixed submission:
n=list(input())
k=int(input())
if len(n)==1 and n[0]=='1':
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.append(n.pop(0))
    else:
      break
  if k<=len(one_list):
    print('1')
  else:
    print(n[0])

Buggy python submission (verdict: Runtime Error):
n=list(input())
k=int(input())
if len(n)==1:
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.pop(n.pop(0))
    else:
      break
  if 0<len(one_list)<=k:
    print('1')
  else:
    print(n[0])

Fixed submission:
n=list(input())
k=int(input())
if len(n)==1 and n[0]=='1':
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.append(n.pop(0))
    else:
      break
  if k<=len(one_list):
    print('1')
  else:
    print(n[0])

Buggy python submission (verdict: Runtime Error):
n=list(input())
k=int(input())
if len(n)==1:
  print('1')
else:
  one_list=[]
  while 1==1:
    if n[0]=='1':
      one_list.pop(n.pop(0))
    else:
      break
  if 0<len(one_list)<=k:
    print('1')
  else:
    print(n[0])



Fixed submission:
n=list(input())
k=int(input())
if len(n)==1 and n[0]=='1':
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.append(n.pop(0))
    else:
      break
  if k<=len(one_list):
    print('1')
  else:
    print(n[0])

Buggy python submission (verdict: Runtime Error):
n=list(input())
k=int(input())
if n[0]=='1':
  print(n[1])
else:
  print(n[0])

Fixed submission:
n=list(input())
k=int(input())
if len(n)==1 and n[0]=='1':
  print('1')
else:
  one_list=[]
  while len(n)!=0:
    if n[0]=='1':
      one_list.append(n.pop(0))
    else:
      break
  if k<=len(one_list):
    print('1')
  else:
    print(n[0])
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

x = []
for i in range(A):
    x.append(1/A[i])
    bunbo = sum(x)
print(1 / bunbo)
    

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

x = []
for i in range(len(A)):
    x.append(1/A[i])
    bunbo = sum(x)
print(1 / bunbo)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = map(int, input().split())

x = []
for i in range(A):
    x.append(1/A[i])
    bunbo = sum(x)
print(1 / bunbo)

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

x = []
for i in range(len(A)):
    x.append(1/A[i])
    bunbo = sum(x)
print(1 / bunbo)
Buggy python submission (verdict: Runtime Error):

k, x = map(int, input().split())

axis = list(range(-10, 11, 1))
df = pd.DataFrame(axis)
df = df.rename(columns = {0 : 'var'})

res = []

if k == 1:
    print(x)
else:
    for i in range(1, k):

        a = df[df['var'] == x + i]
        a = list(a['var'])
        res.append(a)
        
        a = df[df['var'] == x - i]
        a = list(a['var'])
        res.append(a)
    res.append([x])
    res = sum(res, []) #リスト一段解除
    res = sorted(res) #並び替え
    print(*res)


Fixed submission:
a, b = map(int, input().split())

x = a + b
y = a - b
z = a * b
print(max(x, y, z))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

x = a + b
y = a - b
z = a * b
m = max(x, y, z)

print('A + B =', str(x), 'A - B =', str(y), 'A ×　B =', str(z), 'の中で最大の数は', str(m), 'です。')


Fixed submission:
a, b = map(int, input().split())

x = a + b
y = a - b
z = a * b
print(max(x, y, z))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

x = a + b
y = a - b
z = a * b

print(max(x, y, z))

Fixed submission:
a, b = map(int, input().split())

x = a + b
y = a - b
z = a * b
print(max(x, y, z))