Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from itertools import combinations

n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))

idx = range(n)
result = [0, sum(value)-sum(cost)]
index = [idx for idx, v, c in enumerate(zip(value, cost)) if v > c]
comb = [com for i in range(1, len(index)) for com in combinations(index, i)]

for com in comb:
  tmp = 0
  for c in com:
    tmp += value[c]-cost[c]
  result.append(tmp)
    
print(max(result))

Fixed submission:
n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
result = 0
for v, c in zip(value, cost):
  if v > c:
    result += v-c
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations

n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))

idx = range(n)
result = [0, sum(value)-sum(cost)]
comb = [com for i in range(1, n) for com in combinations(idx, i)]

for com in comb:
  tmp = 0
  for c in com:
    tmp += value[c]-cost[c]
  result.append(tmp)
    
print(max(result))

Fixed submission:
n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
result = 0
for v, c in zip(value, cost):
  if v > c:
    result += v-c
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations

n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))

idx = range(n)
result = [0, sum(value)-sum(cost)]

for i in range(n):
  for com in combinations(idx, i):
    tmp = 0
    for c in com:
      tmp += value[c]-cost[c]
    result.append(tmp)
    
print(max(result))

Fixed submission:
n = int(input())
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
result = 0
for v, c in zip(value, cost):
  if v > c:
    result += v-c
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = list(map(int, input().split()))
arr = [i for i in range(a, b+1)]
if (b-a)*2 < k:
  for i in arr:
    print(i)
  exit()
result = sorted(set(arr[:k] + arr[len(arr)-k:]))
for i in result:
  print(i)


Fixed submission:
a, b, k = list(map(int, input().split()))
list_a = [i for i in range(a, min(a+k, b))]
list_b = [i for i in range(max(a, b+1-k), b+1)]
for i in sorted(set(list_a+list_b)):
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = list(map(int, input().split()))
arr = [i for i in range(a, b+1)]
if (b-a)*2 < k:
  for i in arr:
    print(i)
  exit()
result = arr[:k] + arr[len(arr)-k:]
for i in sorted(set(result)):
  print(i)

Fixed submission:
a, b, k = list(map(int, input().split()))
list_a = [i for i in range(a, min(a+k, b))]
list_b = [i for i in range(max(a, b+1-k), b+1)]
for i in sorted(set(list_a+list_b)):
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = list(map(int, input().split()))
arr = [i for i in range(a, b+1)]
result = arr[:k] + arr[len(arr)-k:]
for i in sorted(set(result)):
  print(i)

Fixed submission:
a, b, k = list(map(int, input().split()))
list_a = [i for i in range(a, min(a+k, b))]
list_b = [i for i in range(max(a, b+1-k), b+1)]
for i in sorted(set(list_a+list_b)):
  print(i)
Buggy python submission (verdict: Runtime Error):
import numpy
row1 = input()
row2 = input()
if row1[0] == row2[2] and row1[1] == row2[1] and row1[2] == row2[0]:
  print('YES')
print('NO)

Fixed submission:
row1 = input()
row2 = input()
if row1[0] == row2[2] and row1[1] == row2[1] and row1[2] == row2[0]:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
words = input()
key = input()
for i in range(len(words)):
    if words[i:i+len(key)] == key:
         words[i:i+len(key)] = key
         print(words.replace('?', 'a'))
else:
    print('UNRESTORABLE')

Fixed submission:
r = int(input())
g = int(input())

print(g*2-r)
Buggy python submission (verdict: Runtime Error):
# -*- coding: UTF-8 -*-

nums = input().split()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0])

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
# -*- coding: UTF-8 -*-

nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0])

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0])

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
del set_nums[other]
print(set_nums[0])

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = input()
print(sum(nums) - sum(set(nums)))

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = input()
print(sum(nums)-sum(set(nums)))

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = input().strip().split()
print(sum(nums)-sum(set(nums)))

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])

Buggy python submission (verdict: Runtime Error):
nums = map(int, input().split())
print(sum(nums)-set(nums))

Fixed submission:
nums = map(int, input().split())
d = {}
for n in nums:
  d.setdefault(n, 0)
  d[n] += 1
print(list(d.keys())[list(d.values()).index(1)])
Buggy python submission (verdict: Runtime Error):
h, w = input().split()
for i in range(int(h)):
  row = [input() for i in range(int(w))]
print(row)

Fixed submission:
h, w = list(map(int, input().split()))
a = [input() for i in range(h)]
x_ = [-1, -1, -1, 0, 0, 1, 1, 1]
y_ = [-1, 0, 1, -1, 1, -1, 0, 1]
result = [['0' for i in range(w)] for j in range(h)]
for i in range(h):
  for j in range(w):
    count = 0
    if a[i][j] == '#':
      result[i][j] = '#'
      continue
    for k in range(8):
      x = i+x_[k]
      y = j+y_[k]
      if x<0 or y<0 or x>=h or y>=w:
        continue
      elif a[x][y] == '#':
        count += 1
    result[i][j] = str(count)
for i in result:
  print(''.join(i))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
t = [1 if a[i] == a[j] or abs(a[i] - a[j]) == 1 else 0 for i in range(n) for j in range(n)]
print(max([sum(t[i:i+n]) for i in range(0, len(t), n)]))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
count = {}
for i in a:
  for j in [-1, 0, 1]:
    count.setdefault(i+j, 0)
    count[i+j] += 1
  
print(max(count.values()))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
count = []
for x in a:
  tmp = 0
  for i in a:
    if x == i or abs(x - i) == 1:
      tmp += 1
  count.append(tmp)
print(max(count))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
count = {}
for i in a:
  for j in [-1, 0, 1]:
    count.setdefault(i+j, 0)
    count[i+j] += 1
  
print(max(count.values()))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
count = []
for x in a:
  tmp = 0
  for i in a:
    if x == i:
      tmp += 1
    elif abs(x - i) == 1:
      tmp += 1
    else:
      continue
  count.append(tmp)
print(max(count))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
count = {}
for i in a:
  for j in [-1, 0, 1]:
    count.setdefault(i+j, 0)
    count[i+j] += 1
  
print(max(count.values()))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
idx = 0
count = 0
for i in range(n):
  if idx >= n:
    break
  for j in range(n, 0, -1):
    if a[idx:j] == sorted(a[idx:j]) or a[idx:j] == sorted(a[idx:j], reverse=True):
      idx += len(a[idx:j])
      count += 1
      break
print(count)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
# 0: 1:増加 2:減少
state = 0
count = 1
for i in range(1, n):
  if state == 0:
    if a[i-1] < a[i]:
      state = 1
    elif a[i-1] > a[i]:
      state = 2
  elif state == 1:
    if a[i-1] > a[i]:
      state = 0
      count += 1
  else:
    if a[i-1] < a[i]:
      state = 0
      count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
idx = 0
count = 0
for i in range(n):
  if idx == n:
    break
  for j in range(n, 0, -1):
    if a[idx:j] == sorted(a[idx:j]) or a[idx:j] == sorted(a[idx:j], reverse=True):
      idx += len(a[idx:j])
      count += 1
      break
print(count)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
# 0: 1:増加 2:減少
state = 0
count = 1
for i in range(1, n):
  if state == 0:
    if a[i-1] < a[i]:
      state = 1
    elif a[i-1] > a[i]:
      state = 2
  elif state == 1:
    if a[i-1] > a[i]:
      state = 0
      count += 1
  else:
    if a[i-1] < a[i]:
      state = 0
      count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
num = input()
get = num // 15

print((num * 800) - (get * 200))

Fixed submission:
num = int(input())
get = num // 15

print((num * 800) - (get * 200))

Buggy python submission (verdict: Runtime Error):
num = input()
get = num / 15
print((num * 800) - (get * 200))


Fixed submission:
num = int(input())
get = num // 15

print((num * 800) - (get * 200))

Buggy python submission (verdict: Runtime Error):
num = input()
get = num // 15
print(num * 800 - get * 200)

Fixed submission:
num = int(input())
get = num // 15

print((num * 800) - (get * 200))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
power = 1
for i in range(1, n+1):
  power *= i
print(power%(10**9+7))

Fixed submission:
n = int(input())
power = 1
for i in range(1, n+1):
  power = (power*i)%(10**9+7)
print(power)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
d = input()

print(max((a * b), (c * d)))

Fixed submission:
#!/usr/bin/env python3
# -*- coding: UTF-8 -*-

a, b, c, d = map(int, input().strip().split())
print(max(a*b, c*d))
Buggy python submission (verdict: Time Limit Exceeded):
#! -*- coding: UTF-8 -*-

import itertools

k, s = map(int, input().strip().split())
result = [i for i in itertools.product(range(k+1), repeat=3) if sum(i) == s]
print(len(result))


Fixed submission:
k, s = list(map(int, input().split()))
result = 0
for x in range(k+1):
  for y in range(k+1):
    if 0 <= s-x-y <= k:
      result += 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
#! -*- coding: UTF-8 -*-

import itertools

k, s = map(int, input().strip().split())
result = 0
for i in itertools.product(range(k + 1), repeat=3):
    if sum(i) == s:
        result += 1
print(result)
    


Fixed submission:
k, s = list(map(int, input().split()))
result = 0
for x in range(k+1):
  for y in range(k+1):
    if 0 <= s-x-y <= k:
      result += 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
#! -*- coding: UTF-8 -*-

import itertools

k, s = map(int, input().strip().split())
result = 0
for i in itertools.product(range(k + 1), repeat=3):
    if sum(i) == s:
        result += 1
print(result)
    


Fixed submission:
k, s = list(map(int, input().split()))
result = 0
for x in range(k+1):
  for y in range(k+1):
    if 0 <= s-x-y <= k:
      result += 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
#! -*- coding: UTF-8 -*-

import itertools

k, s = map(int, input().strip().split())
result = 0
for i in itertools.product(range(k + 1), repeat=3):
    if sum(i) == s:
        result += 1
print(result)
    


Fixed submission:
k, s = list(map(int, input().split()))
result = 0
for x in range(k+1):
  for y in range(k+1):
    if 0 <= s-x-y <= k:
      result += 1
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()[::-1]
keys = ["dream", "dreamer", "erase", "eraser"]
keys_ = [i[::-1] for i in keys]
i = 0
t = ''

while(i < len(s)):
  for key in keys_:
    if s[i:].startswith(key):
      t += key
      i += len(key)
    if t == s:
      print('YES')
      exit()
    else:
      continue
else:
  print('NO')

Fixed submission:
s = input()[::-1]
keys = ["dream", "dreamer", "erase", "eraser"]
keys_ = [i[::-1] for i in keys]
i = 0
t = ''

for _ in range(len(s)):
  for key in keys_:
    if s[i:].startswith(key):
      t += key
      i += len(key)
    if t == s:
      print('YES')
      exit()
else:
  print('NO')

Buggy python submission (verdict: Time Limit Exceeded):
s = input()[::-1]
keys = ["dream", "dreamer", "erase", "eraser"]
keys_ = [i[::-1] for i in keys]
i = 0
t = ''

while(i < len(s)):
  for key in keys_:
    if s[i:].startswith(key):
      t += key
      i += len(key)
    if t == s:
      print('YES')
      exit()
    else:
      continue
else:
  print(t)
  print('NO')

Fixed submission:
s = input()[::-1]
keys = ["dream", "dreamer", "erase", "eraser"]
keys_ = [i[::-1] for i in keys]
i = 0
t = ''

for _ in range(len(s)):
  for key in keys_:
    if s[i:].startswith(key):
      t += key
      i += len(key)
    if t == s:
      print('YES')
      exit()
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
k,n=map(int,input())
if k*500>=n:
    print("YES")
else:
    print("NO")

Fixed submission:
k,n=map(int,input().split())
if k*500>=n:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
i=1 
a=[0]
A=[0]

while i<=n:
    a.append(int(input()))
    A.append(1/a[i])
    A[0]+=A[i]
    i+=1

print(1/A[0])

Fixed submission:
n=int(input())
i=1
a=list(map(int,input().split()))
A=[0]

while i<=n:
    A.append(1/a[i-1])
    A[0]+=A[i]
    i+=1

print(1/A[0])
Buggy python submission (verdict: Runtime Error):
A, B, C = input().split()
temp = C-A-B
if temp < 0:
  temp = 0
print(temp)

Fixed submission:
A, B, C = map(int, input().split())
temp = C-A+B
if temp < 0:
  temp = 0
print(temp)
Buggy python submission (verdict: Runtime Error):
n,m=[int(x) for x in input().split()]
a=[0 for _ in range(n)]
b=[0 for _ in range(n)]
for _ in range(m):
  p,q=input().split()
  if q=="AC": a[int(p)-1]=1+b[int(p)-1]
    else : b[int(p)-1]+=1
xg=0
for x in a:
  if x>0: xg+=1
print(xg,sum(a))

Fixed submission:
n,m=[int(x) for x in input().split()]
a=[0 for _ in range(n)]
b=[0 for _ in range(n)]
xg=0
for _ in range(m):
  p,q=input().split()
  #print(p,q)
  if q=="AC": 
    #print("fir")
    rg=a[int(p)-1]
    if rg==0: a[int(p)-1]=1; xg+=b[int(p)-1]
  else : 
    #print("sec")
    b[int(p)-1]+=1
print(sum(a),xg)
Buggy python submission (verdict: Runtime Error):
N,W=[int(x) for x in input().split()]
w=[-1 for _ in range(N)]
v=[-1 for _ in range(N)]
for i in range(N):
	w[i],v[i]=[int(x) for x in input().split()]
#Constraints W<=10^5 w[i]<=10^5 and v[i]<=10^9
dp=[-1 for _ in range(W+1)]
dp[0]=0
for i in range(n):
	for w in range(W,w[i]-1,-1):
		dp[w]=max(dp[w],dp[w-w[i]]+v[i])
for i in range(W,-1,-1):
	if dp[i]!=-1: print(dp[i]); break
# dp[w0] stores maximum value with weight =w0 and using 1...i

Fixed submission:
N,W=[int(x) for x in input().split()]
w=[-1 for _ in range(N)]
v=[-1 for _ in range(N)]
for i in range(N):
	w[i],v[i]=[int(x) for x in input().split()]
#Constraints W<=10^5 w[i]<=10^5 and v[i]<=10^9
dp=[0 for _ in range(W+1)]
for i in range(N):
	for w_ in range(W,w[i]-1,-1):
		dp[w_]=max(dp[w_],dp[w_-w[i]]+v[i])
print(dp[W])
# dp[w0] stores maximum value with weight =w0 and using 1...i
Buggy python submission (verdict: Runtime Error):

if __name__ == "__main__":
    H, W = [int(s) for s in input().split()]



    accepted = [False] * N
    penalties = [0] * N
    for _ in range(M):
        p, S = input().split()
        p = int(p)
        # S = 'AC' or 'WA'
        if S == "AC":
            accepted[p - 1] = True
        if S == "WA" and not accepted[p - 1]:
            penalties[p - 1] += 1

    N_accepted = len([a for a in accepted if a])
    sum_penalties = sum([p for p, a in zip(penalties, accepted) if a])
    print(N_accepted, sum_penalties)

Fixed submission:
if __name__ == "__main__":
    N, M = [int(s) for s in input().split()]
    accepted = [False] * N
    penalties = [0] * N
    for _ in range(M):
        p, S = input().split()
        p = int(p)
        # S = 'AC' or 'WA'
        if S == "AC":
            accepted[p - 1] = True
        if S == "WA" and not accepted[p - 1]:
            penalties[p - 1] += 1

    N_accepted = len([a for a in accepted if a])
    sum_penalties = sum([p for p, a in zip(penalties, accepted) if a])
    print(N_accepted, sum_penalties)
Buggy python submission (verdict: Runtime Error):
A, B, K = [int(s) for s in input().split()]

if K <= A:
    print(A-K, B)
elif K <= A + B:
    print(0, A+B-K)
else:
    print(0, 0)

Fixed submission:
S,T = input().split()
print(T + S)
Buggy python submission (verdict: Runtime Error):
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
wa=0
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        wa+=1

print(f"{ac} {wa}")

Fixed submission:
a=ord(str(input())[0])

print(chr(a+1))

Buggy python submission (verdict: Runtime Error):
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
wa=0
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        wa+=1

print(f"{ac} {wa}")

Fixed submission:
a=ord(str(input())[0])

print(chr(a+1))
Buggy python submission (verdict: Runtime Error):
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
was={}
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        was[p]=was.get(p,0)+1

wa=0
for k,v in result.items():
    if v == "AC":
        wa+=was[k]
print(str(ac)+" "+str(wa))

Fixed submission:
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
was={}
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        was[p]=was.get(p,0)+1

wa=0
for k,v in result.items():
    if v == "AC":
        wa+=was.get(k,0)
print(str(ac)+" "+str(wa))

Buggy python submission (verdict: Runtime Error):
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
wa=0
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        wa+=1

print(f"{ac} {wa}")

Fixed submission:
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
was={}
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        was[p]=was.get(p,0)+1

wa=0
for k,v in result.items():
    if v == "AC":
        wa+=was.get(k,0)
print(str(ac)+" "+str(wa))

Buggy python submission (verdict: Runtime Error):
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
wa=0
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        wa+=1

print(f"{ac} {wa}")




Fixed submission:
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
was={}
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        was[p]=was.get(p,0)+1

wa=0
for k,v in result.items():
    if v == "AC":
        wa+=was.get(k,0)
print(str(ac)+" "+str(wa))
Buggy python submission (verdict: Runtime Error):
s = input()
print chr(ord(s) + 1)

Fixed submission:
s = input()
print(chr(ord(s) + 1))
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
o = -1
if A >= 10 or B >= 10:
    print(o)
else:
print(A*B)
end:

Fixed submission:
A,B = map(int,input().split())
o = -1
if A >= 10 or B >= 10:
    print(o)
else:
    print(A*B)

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
o = -1
if A >= 10 or B>=10
    print(o)
else:
print(A*B)



Fixed submission:
A,B = map(int,input().split())
o = -1
if A >= 10 or B >= 10:
    print(o)
else:
    print(A*B)

Buggy python submission (verdict: Runtime Error):
A,B = int(input())
o = -1
if A >= 10 or B>=10
    print(o)
else:
print(A*B)



Fixed submission:
A,B = map(int,input().split())
o = -1
if A >= 10 or B >= 10:
    print(o)
else:
    print(A*B)

Buggy python submission (verdict: Runtime Error):
A,B = input()
o = -1
if A >= 10 or B>=10
    print(o)
else:
print(A*B)



Fixed submission:
A,B = map(int,input().split())
o = -1
if A >= 10 or B >= 10:
    print(o)
else:
    print(A*B)
Buggy python submission (verdict: Runtime Error):
N, K, M = map(int, input().split())
A = list(map(int, input().split()))
 
if  N*M - sum(A) >= K:
    print('-1')
else:
  print(N*M - sum(A))

Fixed submission:
tmp = input()
ans = chr(ord(tmp) + 1)
print(ans)

Buggy python submission (verdict: Runtime Error):
tmp = Input()
ans = chr(ord(tmp) + 1)
print(ans)

Fixed submission:
tmp = input()
ans = chr(ord(tmp) + 1)
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
import numpy as np
N, D = map(int, input().split())
times = int(input())  
n = [list(map(int, input().split())) for i in range(times)]
n = np.array(n)
ans = 0
for j in range(n.shape[0]):
  for i in range(n.shape[0]):
    length = np.linalg.norm(n[i]-n[j])
    aaa = math.modf(length)[0]
    if aaa < 0.00001:
      ans +=1
ans = ans - n.shape[0]
ans = int(ans/2)
print(ans)

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

if n*a >= b:
  ans = b
else:
  ans = n*a
print(ans)