Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
s = input()

if s[k-1] == 'A':
    print(s[:k-1]　+ 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

if s[k-1] == 'A':
    print(s[:k-1]　+ 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

if s[k-1] == 'A':
    s[k-1] = 'a'

elif s[k-1] == 'B':
    s[k-1] = 'b'

elif s[k-1] == 'C':
    s[k-1] = 'c'
    
print(s)

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

if s[k-1] == 'A':
    s[k-1] = 'a'

elif s[k-1] == 'B':
    s[k-1] = 'b'

elif s[k-1] == 'C':
    s[k-1] = 'c'

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

x = str(s[k-1])
y = x.lower()
s[k-1] = y

print(s)

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

x = s[k-1]
y = x.lower()
s[k-1] = y

print(s)

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])

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

x = s[k-1]
y = x.capitalize()
s[k-1] = y

print(s)

Fixed submission:
n, k = map(int, input().split())
s = str(input())

if s[k-1] == 'A':
    print(s[:k-1] + 'a' + s[k:])

elif s[k-1] == 'B':
    print(s[:k-1] + 'b' + s[k:])

else:
    print(s[:k-1] + 'c' + s[k:])
Buggy python submission (verdict: Runtime Error):
a, b = int(input().split())

if a >= b:
    c = a - 1
    k = max(c,b)
    print(a+k)

else:
    c = b - 1
    k = max(a,c)
    print(b+k)

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

if a >= b:
    print(a + max(a-1, b))

else:
    print(b + max(a, b-1))

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

if a >= b:
    k = max(a-1, b)
    print(a+k)

else:
    k = max(a, b-1)
    print(b+k)

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

if a >= b:
    print(a + max(a-1, b))

else:
    print(b + max(a, b-1))

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

if a >= b:
    k = a-1
    print(a + max(k,b))

else:
    k = b-1
    print(b + max(a,k))

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

if a >= b:
    print(a + max(a-1, b))

else:
    print(b + max(a, b-1))

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

if a >= b:
    c = a
    a = a-1
    print(c + max(a,b))

else:
    c = b
    b = b-1
    print(c + max(a,b))

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

if a >= b:
    print(a + max(a-1, b))

else:
    print(b + max(a, b-1))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

x = list[a,b,c,d,e]
y = sorted(x)

if k >= y[4] -y[0]:
    print('Yay!')

else:
    print(':(')

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if k >= max(a,b,c,d,e) - min(a,b,c,d,e):
    print('Yay!')

else:
    print(':(')

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

x = list(a,b,c,d,e)
y = sorted(x)

if k >= y[4] -y[0]:
    print('Yay!')

else:
    print(':(')

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if k >= max(a,b,c,d,e) - min(a,b,c,d,e):
    print('Yay!')

else:
    print(':(')
Buggy python submission (verdict: Runtime Error):
s = list(input())
k = [s[0], s[1], s[2], s[3]]
l = [s[5], s[6]]
a = ''.join(int(_) for _ in k)
b = ''.join(int(_) for _ in l)

if a > 2019:
    print('TBD')

elif a == 2018 and b > 4:
    print('TBD')

else:
    print('Heisei')

Fixed submission:
s = input()
s1 = [s[0], s[1], s[2], s[3]]
s2 = [s[5], s[6]]

t1 = int(''.join(s1))
t2 = int(''.join(s2))

if t1 > 2019:
    print('TBD')

elif t1 == 2019 and t2 > 4:
    print('TBD')

else:
    print('Heisei')

Buggy python submission (verdict: Runtime Error):
s = list(input(s))
k = [s[0], s[1], s[2], s[3]]
l = [s[5], s[6]]
a = int(''.join(k))
b = int(''.join(l))

if a > 2019:
    print('TBD')

elif a == 2018 and b > 4:
    print('TBD')

else:
    print('Heisei')

Fixed submission:
s = input()
s1 = [s[0], s[1], s[2], s[3]]
s2 = [s[5], s[6]]

t1 = int(''.join(s1))
t2 = int(''.join(s2))

if t1 > 2019:
    print('TBD')

elif t1 == 2019 and t2 > 4:
    print('TBD')

else:
    print('Heisei')
Buggy python submission (verdict: Runtime Error):
D = input()
dic = {22:'Christmas Eve Eve Eve', 23:'Christmas Eve Eve', 24:'Christmas Eve', 25:'Christmas'}
print(dic[D])

Fixed submission:
D = int(input())
dic = {22:'Christmas Eve Eve Eve', 23:'Christmas Eve Eve', 24:'Christmas Eve', 25:'Christmas'}
print(dic[D])
Buggy python submission (verdict: Runtime Error):
n = int(input())

print('Hello World' if n == 1)

if n == 2:
    a = [int(input()) for _ in range(2)]

    print(sum(a))

Fixed submission:
n = int(input())

if n == 1:
    print('Hello World')

if n == 2:
    a = [int(input()) for _ in range(2)]

    print(sum(a))

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

print('Hello World' if n == 1)

if n == 2:
    for _ in range(2):
        a = [int(input())]

    print(sum(a))

Fixed submission:
n = int(input())

if n == 1:
    print('Hello World')

if n == 2:
    a = [int(input()) for _ in range(2)]

    print(sum(a))

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

print('Hello World' if n == 1)

if n == 2:
    for _ in range(2):
        a = [int(input())]

    print(a[0]+a[1])

Fixed submission:
n = int(input())

if n == 1:
    print('Hello World')

if n == 2:
    a = [int(input()) for _ in range(2)]

    print(sum(a))

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

print('Hello World' if n == 1)

if n == 2:
    for _ in range():
        a, b = int(input())

    print(a+b)

Fixed submission:
n = int(input())

if n == 1:
    print('Hello World')

if n == 2:
    a = [int(input()) for _ in range(2)]

    print(sum(a))
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
x = [sorted(a, b, c)]

print(x[2]*10 + x[0] + x[1])

Fixed submission:
a, b, c = map(int, input().split())
x = sorted([a, b, c])

print(x[2]*10 + x[0] + x[1])

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
x = [sorted(a, b, c)]

print(x[3]*10 + x[1] + x[2])

Fixed submission:
a, b, c = map(int, input().split())
x = sorted([a, b, c])

print(x[2]*10 + x[0] + x[1])
Buggy python submission (verdict: Runtime Error):
def rate(n):
    if n < 1200:
        print('ABC')
    elif 1200 <= n <2800:
        print('ARC')
    else:
        print('AGC')

rate(input())

Fixed submission:
def rate(n):
    if n < 1200:
        print('ABC')
    elif 1200 <= n <2800:
        print('ARC')
    else:
        print('AGC')

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

print('YES'　if a<= x <= a+b else 'NO')

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

print('YES' if a <= x <= a+b else 'NO')
Buggy python submission (verdict: Runtime Error):
s = str(input())

print('Yes' if s.count('a')==1 and c.count('b')==1 else 'No')

Fixed submission:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')

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

print('Yes' if s.count(a)==1 and c.count(b)==1 else 'No')

Fixed submission:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')

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

print('Yes' if s.count(a)+s.count(b) == 2 else 'No')

Fixed submission:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')

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

print('Yes' if s.count(a)+s.count(b)==2 else 'No')

Fixed submission:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')

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

print('Yes' if s.count(a)+s.count(b)=2 else 'No')

Fixed submission:
s = str(input())

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')
Buggy python submission (verdict: Runtime Error):
x = [map(str, input().split())]
y = [map(str, input().split())]
z = [map(str, input().split())]

print(''.join([x[0], y[1], z[2]]))

Fixed submission:
x = str(input())
y = str(input())
z = str(input())
 
s = [x[0], y[1], z[2]]

print(''.join(s))

Buggy python submission (verdict: Runtime Error):
x = list(map(str, input().split()))
y = list(map(str, input().split()))
z = list(map(str, input().split()))

print(''.join([x[0], y[1], z[2]]))

Fixed submission:
x = str(input())
y = str(input())
z = str(input())
 
s = [x[0], y[1], z[2]]

print(''.join(s))

Buggy python submission (verdict: Runtime Error):
x = list(map(str, input().split()))
y = list(map(str, input().split()))
z = list(map(str, input().split()))

print(''.join(x[0], y[1], z[2]))

Fixed submission:
x = str(input())
y = str(input())
z = str(input())
 
s = [x[0], y[1], z[2]]

print(''.join(s))
Buggy python submission (verdict: Runtime Error):
s = str(input())
print('2018/01' + s[-2] + a[-1])

Fixed submission:
s = input()
print('2018/01/' + s[-2] + s[-1])

Buggy python submission (verdict: Runtime Error):
s = input()
print('2018/01' + s[-2] + a[-1])

Fixed submission:
s = input()
print('2018/01/' + s[-2] + s[-1])

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

if a == 2017:
    print('{}/{}/{}'.format(2018, b, c))

Fixed submission:
s = input()
print('2018/01/' + s[-2] + s[-1])
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())

if a+b > c+d:
    print('Left')

elif a+b = c+d:
    print('Balanced')

else:
    print('Right')

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

if a+b > c+d:
    print('Left')

elif a+b == c+d:
    print('Balanced')

else:
    print('Right')
Buggy python submission (verdict: Runtime Error):
s = str(input())

print(s.count(1))

Fixed submission:
s = str(input())

print(s.count('1'))
Buggy python submission (verdict: Runtime Error):
dic = {'A':10, 'B':11, 'C':12, 'D':13, 'E':14, 'F':15}
x, y = map(str, input().split())

if dic[x] < dic[y]:
    print('<')

elif dic[x] = dic[y]:
    print('=')

else:
    print('>')

Fixed submission:
dic = {'A':10, 'B':11, 'C':12, 'D':13, 'E':14, 'F':15}
x, y = map(str, input().split())

if dic[x] < dic[y]:
    print('<')

elif dic[x] == dic[y]:
    print('=')

else:
    print('>')
Buggy python submission (verdict: Runtime Error):
tx = [map(int, input().split(,))]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Fixed submission:
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])

Buggy python submission (verdict: Runtime Error):
tx = [map(int, input().split())]
cx = [sorted(tx)]

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Fixed submission:
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])

Buggy python submission (verdict: Runtime Error):
tx = [map(int, input().split())]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*int(cx[i]))
        break

Fixed submission:
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])

Buggy python submission (verdict: Runtime Error):
tx = [map(int, input().split())]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Fixed submission:
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])

Buggy python submission (verdict: Runtime Error):
tx = [map(int, input().split())]
cx = sorted(x)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Fixed submission:
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])
Buggy python submission (verdict: Runtime Error):
lst0 = [1, 3, 5, 7, 8, 10, 12]
lst1 = [4, 6, 9, 11]
x, y = map(int, input().split())

for i in range(2):
    if x in lst[i] and y in lst[i]:
        print('Yes')
        break

else:
    print('No')

Fixed submission:
lst0 = [1, 3, 5, 7, 8, 10, 12]
lst1 = [4, 6, 9, 11]
x, y = map(int, input().split())

if (x in lst0 and y in lst0) or (x in lst1 and y in lst1):
    print('Yes')

else:
    print('No')

Buggy python submission (verdict: Runtime Error):
lst0 = [1, 3, 5, 7, 8, 10, 12]
lst1 = [4, 6, 9, 11]
x, y = map(int, input().split())

for i in range(2):
    if x in lst[i] and y in lst[i]:
        print('Yes')
        break

else:
    print('No')

Fixed submission:
lst0 = [1, 3, 5, 7, 8, 10, 12]
lst1 = [4, 6, 9, 11]
x, y = map(int, input().split())

if (x in lst0 and y in lst0) or (x in lst1 and y in lst1):
    print('Yes')

else:
    print('No')

Buggy python submission (verdict: Runtime Error):
lst1 = [1, 3, 5, 7, 8, 10, 12]
lst2 = [4, 6, 9, 11]
x, y = map(int, input().split())

for i in range(2):
    if x in lst[i] and y in lst[i]:
        print('Yes')
        break

else:
    print('No')

Fixed submission:
lst0 = [1, 3, 5, 7, 8, 10, 12]
lst1 = [4, 6, 9, 11]
x, y = map(int, input().split())

if (x in lst0 and y in lst0) or (x in lst1 and y in lst1):
    print('Yes')

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print('Yes' if a<=c<=b else 'No')

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

print('YES' if a[-1]==b[0] and b[-1]==c[0] else 'NO')
Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(str, input().split())
lst = [s[0], s[1], s[2]].capitallize()
print(''.join(lst))

Fixed submission:
s1, s2, s3 = map(str, input().split())
lst = [s1[0].capitalize(), s2[0].capitalize(), s3[0].capitalize()]
print(''.join(lst))
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 *= i
    power %= 10**9+7

print(power)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = [str(input()) for _ in range(n)]
b = [str(input()) for _ in range(m)]
flag = False
for k in range(n-m+1):
    cnt = 0
    for i in range(m):
        for j in range(m):
            if b[k+i][j]==a[k+i][j]:
                cnt += 1
        if cnt==m**2:
            flag = True
            break
    if flag:
        break
print('Yes' if flag else 'No')

Fixed submission:
n,m = map(int,input().split())
a = [str(input()) for _ in range(n)]
b = [str(input()) for _ in range(m)]
flag = False
for l in range(n-m+1):
    for k in range(n-m+1):
        cnt = 0
        for i in range(m):
            for j in range(m):
                if a[k+i][j+l]==b[i][j]:
                    cnt += 1
            if cnt==m**2:
                flag = True
                break
        if flag:
            break
    if flag:
        break
print('Yes' if flag else 'No')
Buggy python submission (verdict: Runtime Error):
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13
        ans += ' '

    else:
        ans += s[i]

print(ans)


Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)

Buggy python submission (verdict: Runtime Error):
s = str(input())
ans = ''

for i in range(19):
    
    if i == 5 or 13
        ans += ' '

    else:
        ans += s[i]

print(ans)


Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)

Buggy python submission (verdict: Runtime Error):
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13
        ans += ','
    else:
        ans += s[i]

print(ans)

Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)

Buggy python submission (verdict: Runtime Error):
s = str(input()) 
lst = [s[0:5], , s[6:13], , s[14:]]
print(''.join(lst))

Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)

Buggy python submission (verdict: Runtime Error):
s = str(input())
print(s[0:5]+' '+s[6:13]+' '+s[14:]

Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)

Buggy python submission (verdict: Runtime Error):
a, b, c = map(str, input().split(,))

print(a+''+b+''+c)

Fixed submission:
s = str(input())
ans = ''

for i in range(19):
    
    if i==5 or i==13:
        ans += ' '

    else:
        ans += s[i]

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
cnt = 0
lst = []

for i in range(k+1):
    for j in range(k+1):
        lst.append(i+j)

for i in range(len(lst)):
    for j in range(k+1):
        if lst[i]==s-j:
            cnt += 1

print(cnt)

Fixed submission:
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
    for j in range(k+1):
        if 0<=s-i-j<=k:
            cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
    for j in range(k+1):
        for l in range(k+1):
            if i+j+l==s:
                cnt += 1
print(cnt)

Fixed submission:
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
    for j in range(k+1):
        if 0<=s-i-j<=k:
            cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
px = [list(map(int,input().split())) for _ in range(m)]

for i in range(m):
    print(sum(t)-t[px[i][0]]+px[i][1])

Fixed submission:
n = int(input())
t = list(map(int,input().split()))
m = int(input())
px = [list(map(int,input().split())) for _ in range(m)]

for i in range(m):
    print(sum(t)-t[px[i][0]-1]+px[i][1])

Buggy python submission (verdict: Runtime Error):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
px = [list(map(int,input().split())) for _ in range(m)]

for i in range(m):
    print(sum(t)-t[i]+px[i][1])

Fixed submission:
n = int(input())
t = list(map(int,input().split()))
m = int(input())
px = [list(map(int,input().split())) for _ in range(m)]

for i in range(m):
    print(sum(t)-t[px[i][0]-1]+px[i][1])
Buggy python submission (verdict: Runtime Error):

import math

a,b=map(int,input().split())
print(int(a*b/math.gcd(a,b)))

Fixed submission:

def gcd(a,b):
    if(a>b):a,b=b,a
    if(a==0):return b
    return gcd(b%a,a)

a,b=map(int,input().split())
print(int(a*b/gcd(a,b)))

Buggy python submission (verdict: Runtime Error):

def gcd(a,b):
    if(a>b):swap(a,b)
    if(a==0):return b
    return gcd(b%a,a)

a,b=map(int,input().split())
print(int(a*b/gcd(a,b)))

Fixed submission:

def gcd(a,b):
    if(a>b):a,b=b,a
    if(a==0):return b
    return gcd(b%a,a)

a,b=map(int,input().split())
print(int(a*b/gcd(a,b)))
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if(a>=10):
    print(-1)
elif(b>=10):
    print(-1)
else:
    print(a*b)
    
#print(a+1)
#print(b+1)

Fixed submission:
a,b=map(int,input().split())
if(a>=10):
    print(-1)
elif(b>=10):
    print(-1)
else:
    print(a*b)

Buggy python submission (verdict: Runtime Error):
a=int(input())
if a>=10:
    print(-1)
else:
    b=int(input())
    if b>=10:
        print(-1)
    else:
        print(a*b)


Fixed submission:
a,b=map(int,input().split())
if(a>=10):
    print(-1)
elif(b>=10):
    print(-1)
else:
    print(a*b)

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a>=10:
    print(-1)
elif b>=10:
    print(-1)
else:
    print(a*b)

Fixed submission:
a,b=map(int,input().split())
if(a>=10):
    print(-1)
elif(b>=10):
    print(-1)
else:
    print(a*b)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[0]*10
#print(a)
m=list(map(int,input().split()))
#print(m)
for i in range(n):
    a[m[i]-1]=i+1
for i in range(n):
    print(a[i],end=" ")
    

Fixed submission:
n=int(input())
a=[0]*n
m=list(map(int,input().split()))
#print(m)
for i in range(n):
    a[m[i]-1]=i+1
for i in range(n):
    print(a[i],end=" ")
Buggy python submission (verdict: Runtime Error):

import math

"""
def gcd(a,b):
    if a>b:swap(a,b)
    if a==0:return b
    return gcd(b%a,a)
"""

a,b=map(int,input().split())
g=math.gcd(a,b)
#print(g)
ans=1
i=2
while i*i<=g:
    if(g%i==0):
        ans+=1
        g/=i
    i=i+1
if(g!=1):ans+=1
print(ans)

Fixed submission:

import fractions

"""
def gcd(a,b):
    if a>b:swap(a,b)
    if a==0:return b
    return gcd(b%a,a)
"""

a,b=map(int,input().split())
g=fractions.gcd(a,b)
#print(g)
ans=1
i=2
while i*i<=g:
    if(g%i==0):
        ans+=1
        while g%i==0:
            g/=i
    i=i+1
if(g!=1):ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
ifbreak = "FALSE"
for i in range(n**0.5):
  for j in range(**0.5):
    print(i,j)


Fixed submission:
n=int(input())
ifbreak = "FALSE"
for i in range(9):
  for j in range(9):
    if n == ((i+1)*(j+1)):
      print("Yes")
      ifbreak = "TRUE"
      break
  if ifbreak=="TRUE":
    break
if ifbreak == "FALSE":
  print("No")
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split(' '))
cost = 0
count = 0

mlist = list()
for i in range(n):
  mlist.append(list(map(int,input().split(' '))))
mlist.sort(key=lambda x: x[0])

for i in range(n):
  ablist = mlist[i]
  if count+ablist[1] <= m:
    count += ablist[1]
    cost += ablist[0]*ablist[1] 
  else:
    for j in range(ablist[1]):
      count += 1
      if count <= m:
        cost += ablist[0]
      else:
        break_t = True
        break
    if break_t:
      break
print(cost)



Fixed submission:
hh, ww = map(int,input().split(' '))
h, w = map(int,input().split(' '))
ans = (hh-h)*(ww-w)
print(ans)
Buggy python submission (verdict: Runtime Error):
abc = list(map(int,input().split(" "))
m = max(abc)
s = sum(abc)
ans = s-m+(m*10)
print(ans)

Fixed submission:
abc =list(map(int,input().split(" "))) 
m = max(abc)
s = sum(abc)
ans = s-m+(m*10)
print(ans)