Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

if a + b == 15 and 1 <= a <=15 and 1 <= b <=15:
    print('+')
elif  a * b == 15 and 1 <= a <=15 and 1 <= b <=15:
    print('*')
else:
    print('x')

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

if a + b == 15 and 1 <= a <=15 and 1 <= b <=15:
    print('+')
elif  a * b == 15 and 1 <= a <=15 and 1 <= b <=15:
    print('*')
else:
    print('x')
Buggy python submission (verdict: Runtime Error):
n = int(input())
print(n*n*n*)

Fixed submission:
n = int(input())
print(n*n*n)

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

Fixed submission:
n = int(input())
print(n*n*n)
Buggy python submission (verdict: Time Limit Exceeded):
n,w = map(int,input().split())
wt = [0]*n
v = [0]*n
dp = [[0 for _ in range(w)]for _ in range(n)]
for i in range(n):
    wt[i],v[i] = map(int,input().split())
for i in range(w):
    if(wt[0]>i+1):dp[0][i] = 0
    else:dp[0][i] = v[0]
for i in range(1,n):
    for j in range(w):
        if(wt[i]>j+1):
            dp[i][j] = dp[i-1][j]
        else:
            remain = (j+1) - wt[i]
            res = 0
            if(remain > 0):
                res = v[i] + dp[i-1][remain-1]
            else:
                res = v[i]
            dp[i][j] = max(dp[i-1][j],res)

print(dp[n-1][w-1])



Fixed submission:
n,w = map(int,input().split())
wt = [0]*n
v = [0]*n
dp = [[0 for _ in range(w)]for _ in range(n)]
for i in range(n):
    wt[i],v[i] = map(int,input().split())
for i in range(w):
    if(wt[0]>i+1):dp[0][i] = 0
    else:dp[0][i] = v[0]
for i in range(1,n):
    for j in range(w):
        if(wt[i]>j+1):
            dp[i][j] = dp[i-1][j]
        else:
            remain = (j+1) - wt[i]
            res = 0
            if(remain > 0):
                res = v[i] + dp[i-1][remain-1]
            else:
                res = v[i]
            dp[i][j] = max(dp[i-1][j],res)

print(dp[n-1][w-1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
string_list=[input() for i in range(n)]
a = int(string_list[0])
if a <= 3200:
  print("red")
else:
  print(a[1])
  

Fixed submission:
n=input()
m=input()

if int(n) < 3200:
  print("red")
else:
  print(m)
Buggy python submission (verdict: Runtime Error):
# Fraction クラスを呼びだします
from fractions import Fraction
n=int(input())
m=input().split()
tmp =0

for x in range(0,n):
  a = Fraction(1, int(m[x]))
  tmp+=a
  
print(Fraction(1, z))

Fixed submission:
# Fraction クラスを呼びだします
from fractions import Fraction
n=int(input())
m=input().split()
tmp =0

for x in range(0,n):
  a = Fraction(1, int(m[x]))
  tmp+=a
  
a_f = float(Fraction(1, tmp))
print(a_f)
Buggy python submission (verdict: Runtime Error):
n = int(input()
print(n**3)

Fixed submission:
n = int(input())
print(n**3)

Buggy python submission (verdict: Runtime Error):
input(int(N))
print(N**3)

Fixed submission:
N = input()
print(int(N)**3)

Buggy python submission (verdict: Runtime Error):
print(N**3)

Fixed submission:
N = input()
print(int(N)**3)
Buggy python submission (verdict: Runtime Error):
a = input()
s = input()
 
if int(a) >= int(3200):
  print(s)
else:
  print(red)

Fixed submission:
a = input()
s = input()
 
if int(a) >= int(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 = input()
s = input()
 
if int(a) >= int(3200):
  print(s)
else:
  print('red')
Buggy python submission (verdict: Runtime Error):
import math
t=input()
t=t.split()
a=int(t[0])
b=int(t[1])
x=(b-1)/(a-1)
x=math.ceil(x)
print(x)



Fixed submission:
n=input()
n=int(n)
print(n**3)
Buggy python submission (verdict: Runtime Error):
from re import fullmatch
S = input()
_s = "keyence"
flag = False
for i in range(len(_s)):
    if fullmatch(f".*{_s[:i]}.*{_s[i:]}.*", S):
        flag = True
print("YES") if flag else print("NO")


Fixed submission:
from re import fullmatch
S = input()
_s = "keyence"
flag = False
for i in range(len(_s)):
    tmp = fullmatch("(.*)" + _s[:i] + "(.*)" + _s[i:] + "(.*)", S)
    if tmp and sum([1 for j in range(1, 4) if tmp.group(j)]) <= 1:
        flag = True
print("YES") if flag else print("NO")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if a == 'H' and b == 'H':
    print('H')
elif a == 'H' and b == 'D':
    print('H')
elif a == 'D' and b == 'H':
    print('D')
else:
    print('H')

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

if a == 'H' and b == 'H':
    print('H')
elif a == 'H' and b == 'D':
    print('D')
elif a == 'D' and b == 'H':
    print('D')
else:
    print('H')

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

if a == 'H' and b == 'H':
    print('H')
elif a == 'H' and b == 'D':
    print('D')
elif a == 'D' and b == 'H':
    print('D')
else:
    print('H')

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

if a == 'H' and b == 'H':
    print('H')
elif a == 'H' and b == 'D':
    print('D')
elif a == 'D' and b == 'H':
    print('D')
else:
    print('H')
Buggy python submission (verdict: Runtime Error):
X = int(input())

for i in range(0, X):
    result += (i+1)
    if X >= result:
        print(i+1)
        break

Fixed submission:
X = int(input())

result = 0
for i in range(0, X):
    result += (i+1)
    if X <= result:
        print(i+1)
        break
Buggy python submission (verdict: Runtime Error):
x = int(input())
result = x **3
print(result

Fixed submission:
x = int(input())
result = x ** 3
print(result)

Buggy python submission (verdict: Runtime Error):
x = int(input())
result = x **3
print(result

Fixed submission:
x = int(input())
result = x ** 3
print(result)
Buggy python submission (verdict: Runtime Error):
N = int(input())
Ai = [int(i) for i in input().split(" ")]
Bi = [int(i) for i in input().split(" ")]
Ci = [int(i) for i in input().split(" ")]

res = 0
pre_i = None
for i in Ai:
  res += Bi[i-1]
  if i == pre_i+1:
    res += Ci[i-1]
  pre_i = i

  print(res)

Fixed submission:
N = int(input())
Ai = [int(i) for i in input().split(" ")]
Bi = [int(i) for i in input().split(" ")]
Ci = [int(i) for i in input().split(" ")]

res = 0
pre_i = None
for i in Ai:
  res += Bi[i-1]
  if pre_i and i == pre_i+1:
    res += Ci[i-2]
  pre_i = i

print(res)

Buggy python submission (verdict: Runtime Error):
N = int(input())
Ai = [int(i) for i in input().split(" ")]
Bi = [int(i) for i in input().split(" ")]
Ci = [int(i) for i in input().split(" ")]

res = 0
res += Ai[N+1]
res += Bi[N+1]
res += Ci[N+2]

print(res)

Fixed submission:
N = int(input())
Ai = [int(i) for i in input().split(" ")]
Bi = [int(i) for i in input().split(" ")]
Ci = [int(i) for i in input().split(" ")]

res = 0
pre_i = None
for i in Ai:
  res += Bi[i-1]
  if pre_i and i == pre_i+1:
    res += Ci[i-2]
  pre_i = i

print(res)

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

a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]

ans = sum(b)
for i in range(len(a)-1):
    if a[i]+1 == a[i+1]:
        ans += c[a[i]-1]


print(ans)
~

Fixed submission:
n = int(input())

a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]

ans = sum(b)
for i in range(len(a)-1):
    if a[i]+1 == a[i+1]:
        ans += c[a[i]-1]


print(ans)
Buggy python submission (verdict: Runtime Error):
n, x = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]

d = 0
count = 0
for i in l:
    if d > x:
        break
    count += 1
    d += i

print(count

Fixed submission:
n, x = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]

d = 0
count = 0
for i in l:
    if d > x:
        break
    count += 1
    d += i

if d <= x:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
#
def happiness(s):
    h = 0
    c = s[0]
    for i in range(1,len(s)):
        if s[i] == c:
            h = h + 1
        else:
            c = s[i]
    return h

def schrun(s,l):
    c = s[l]
    i = l+1
    while (i<len(s)) and (s[i] == c) :
        i = i+1
    return i
        
#
n, k = map(int, input().split())
s = input()
#
h = happiness(s)
i = 0
l = 0
while( (i<k) and (l<n) ):
    l = schrun(s,l)
    r = schrun(s,l)-1
    if r == n-1:
        h = h + 1
    else:
        h = h + 2
    i = i + 1
    l = r + 1

print(h)


Fixed submission:
#

def happiness(s):
    h = 0
    c = s[0]
    for i in range(1,len(s)):
        if s[i] == c:
            h = h + 1
        else:
            c = s[i]
    return h

def schrun(s,l):
    c = s[l]
    i = l+1
    while (i<len(s)) and (s[i] == c) :
        i = i+1
    return i
        
#
n, k = map(int, input().split())
s = input()
#
h = happiness(s)
i = 0
l = 0
while( (i<k) and (l<n) and (h<n-1)):
    l = schrun(s,l)
    r = schrun(s,l)-1
    if r == n-1:
        h = h + 1
    else:
        h = h + 2
    i = i + 1
    l = r + 1

print(h)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
HList = input().split()
mv = 0
for i in range(len(HList) - 1):
    tmv = 0
    for j in range(i, len(HList) - 1):
        if(j == N):
            break
        if(int(HList[j]) < int(HList[j + 1])):
            break
        tmv += 1
    if(mv < tmv):
        mv = tmv
print(mv)

Fixed submission:
N = int(input())
HList = input().split()
res = 0
mv = 0
for i in range(len(HList) -1):
    if(int(HList[i]) >= int(HList[i + 1])):
        mv += 1
    else:
        if(res < mv):
            res = mv
        mv = 0
if(res < mv):
    res = mv
print(res)
Buggy python submission (verdict: Runtime Error):
a = input()
print(a**3)

Fixed submission:
a=int(input())
print(a**3)
Buggy python submission (verdict: Runtime Error):
S=list(map(input().split()))
T=list(map(input().split()))
a==0
for i in S:
  if S[i]==T[i]:
    a=a+1
print(a)
    

Fixed submission:
S=input()
T=input()
a=0
for i in range(len(S)):
  if S[i]==T[i]:
    a=a+1
print(a)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
b=0
for i in range(N):
  b=b+1/A[i]
print 1/b


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
b=0
for i in range(N):
  b=b+1/A[i]
print(1/b)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=input()
b=0
for i in range(N):
  b=b+1/A[i]
print 1/b


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
b=0
for i in range(N):
  b=b+1/A[i]
print(1/b)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=map(int,input().split())
b=0
for i in range(N):
  b=b+1/A[i]
print 1/b

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
b=0
for i in range(N):
  b=b+1/A[i]
print(1/b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c=[a+b,a-b,a*b]
c.sort()
print(c[3])

Fixed submission:
a,b=map(int,input().split())
c=[a+b,a-b,a*b]
c.sort()
print(c[2])
Buggy python submission (verdict: Runtime Error):
N=int(input())
list1=list(map(int,input().split()))
list2=[]
for i in range(1,N):
  list2.append(i)
a=N
for j in range(0,N-1):
  if list1[j]==list[j]:
    a=a-1
if a>2:
  print("NO")
else:
  print("YES")

Fixed submission:
N=int(input())
list1=list(map(int,input().split()))
list2=[]
for i in range(1,N):
  list2.append(i)
a=0
for j in range(0,N-1):
  if not list1[j]==list2[j]:
    a+=1
if a>2:
  print("NO")
else:
  print("YES")
Buggy python submission (verdict: Runtime Error):

n = int(input())

return (n**3 )

Fixed submission:

if (__name__ == '__main__'):
    n = int(input())
    print(n**3)
Buggy python submission (verdict: Runtime Error):
if (__name__ == '__main__'):
    a = [0]
    b = [0]
    c = [0]

    aa = input().strip().split()
    for i in range(n):
        a.append(int(aa[i]))
    bb = input().strip().split()
    for i in range(n):
        b.append(int(bb[i]))
    cc = input().strip().split()
    for i in range(n-1):
        c.append(int(cc[i]))

    sum = b[a[1]]
    lastmenu = a[1]

    for i in range(2, n+1):
        sum = sum + b[a[i]]
        if (a[i] == lastmenu+1):
            sum = sum + c[lastmenu]
        lastmenu = a[i]

    print(sum)


Fixed submission:
if (__name__ == '__main__'):
    n = int(input())
    
    a = [0]
    b = [0]
    c = [0]

    aa = input().strip().split()
    for i in range(n):
        a.append(int(aa[i]))
    bb = input().strip().split()
    for i in range(n):
        b.append(int(bb[i]))
    cc = input().strip().split()
    for i in range(n-1):
        c.append(int(cc[i]))

    sum = b[a[1]]
    lastmenu = a[1]

    for i in range(2, n+1):
        sum = sum + b[a[i]]
        if (a[i] == lastmenu+1):
            sum = sum + c[lastmenu]
        lastmenu = a[i]

    print(sum)

Buggy python submission (verdict: Runtime Error):

if (__name__ == '__main__'):
    n = int(input())
    a = [0]
    b = [0]
    c = [0]
    aa = input().strip().split()
    for i in range(n):
        a.append(int(aa[i]))
    aa = input().strip().split()
        for i in range(n):
            a.append(int(aa[i]))
    bb = input().strip().split()
        for i in range(n):
            b.append(int(bb[i]))
    c = input().strip().split()
        for i in range(n-1):
            c.append(int(cc[i]))

    sum = b[a[1]]
    lastmenu = a[1]

    for i in range(2, n+1):
        sum = sum + b[a[i]]
        if (a[i] == lastmenu+1):
            sum = sum + c[lastmenu]
       lastmenu = a[i]

    print(sum)
    

Fixed submission:
if (__name__ == '__main__'):
    n = int(input())
    
    a = [0]
    b = [0]
    c = [0]

    aa = input().strip().split()
    for i in range(n):
        a.append(int(aa[i]))
    bb = input().strip().split()
    for i in range(n):
        b.append(int(bb[i]))
    cc = input().strip().split()
    for i in range(n-1):
        c.append(int(cc[i]))

    sum = b[a[1]]
    lastmenu = a[1]

    for i in range(2, n+1):
        sum = sum + b[a[i]]
        if (a[i] == lastmenu+1):
            sum = sum + c[lastmenu]
        lastmenu = a[i]

    print(sum)
Buggy python submission (verdict: Runtime Error):
n=input()
print(n**3)

Fixed submission:
n=int(input())
print(n**3)
Buggy python submission (verdict: Time Limit Exceeded):
def new_list(s_list):
    s_list_new = [s_list[0]]
    for i, s in enumerate(s_list):
        if i >= 1:
            if s != s_list[i - 1]:
                s_list_new.append(s)
    return s_list_new

if __name__ == "__main__":
 
    n, k = map(int, input().split())
    stext = str(input())
    s_list = [s for s in stext]
    s_list = new_list(s_list)
    cnt_l = s_list.count('L')
    cnt_r = s_list.count('R')
    replace = 'L'
    replaced = 'R'
    if cnt_l > cnt_r: replace = 'R'
    if cnt_l > cnt_r: replaced = 'L'
    if cnt_l == cnt_r:
        if s_list[0] == 'L': 
            replace = 'R'
            replaced = 'L'
    
    for i in range(k):
        for j, s in enumerate(s_list):
            if s == replace:
                s_list[j] = replaced
                break
    
    s_list = new_list(s_list)
    print('{0}'.format(n - len(s_list)))    

Fixed submission:
def new_list(s_list):
    s_list_new = [s_list[0]]
    for i, s in enumerate(s_list):
        if i >= 1:
            if s != s_list[i - 1]:
                s_list_new.append(s)
    return s_list_new

if __name__ == "__main__":

    count = 0
    n, k = map(int, input().split())
    stext = str(input())
    s_list = [s for s in stext]
    s_list = new_list(s_list)
    cnt_l = s_list.count('L')
    cnt_r = s_list.count('R')
    if cnt_l == cnt_r:
        if k >= cnt_l:
            count = 1
        else:
            count = 2 * (cnt_l - k)
    else:
        cnt_lr = min(cnt_l, cnt_r)
        if k >= cnt_lr:
            count = 1
        else:
            count = 2 * (cnt_lr - k) + 1
                
    print('{0}'.format(n - count))
Buggy python submission (verdict: Runtime Error):
moji_S=input()
moji_T=input()

flag=0
for i in range(len(moji_S)):
	if moji_S==moji_T:
		flag =1
		break
	moji_S=moji_S[-1]+moji_S[0:-1]
if flag:
	print("Yes")
else:
	print("No")


Fixed submission:
A=list(map(int,input().split(' ')))
A.sort()
cost=A[1]-A[0]
cost+=A[2]-A[1]
print(cost)
Buggy python submission (verdict: Runtime Error):
moji_S=input()
moji_T=input()

flag=0
for i in range(len(moji_S)):
	if moji_S==moji_T:
		flag =1
		break
	s=s[-1]+s[0:len-1]
if flag:
	print("Yes")
else:
	print("No")



Fixed submission:
#! python3

moji_S=input()
moji_T=input()

flag=0
for i in range(len(moji_S)):
	if moji_S==moji_T:
		flag =1
		break
	moji_S=moji_S[-1]+moji_S[0:-1]
if flag:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
#D-Face Produces Unhappiness
N, K = map(int, input().split())
S = str(input())
l_index = [l[i]+l[i+1] for i in range(0,N-1)]

count_LRorRL =0
count_LRorRL += S.count('LR')
count_LRorRL += S.count('RL')

count_LLorRR = 0
count_LLorRR += S.count('LL')
count_LLorRR += S.count('RR')

if count_LRorRL > 2*K:
    print(count_LLorRR+2*K)
else:
    print(count_LLorRR+count_LRorRL)

Fixed submission:
#D-Face Produces Unhappiness
N, K = map(int, input().split())
S = str(input())

def count_LRorRL(l):
    ans = 0
    l_index = [l[i]+l[i+1] for i in range(0,N-1)]
    ans += l_index.count('LR')
    ans += l_index.count('RL')
    return ans

def count_LLorRR(l):
    ans = 0
    l_index = [l[i]+l[i+1] for i in range(0,N-1)]
    ans += l_index.count('LL')
    ans += l_index.count('RR')
    return ans
  
if count_LRorRL(S) > 2*K:
    print(count_LLorRR(S)+2*K)
else:
    print(count_LLorRR(S)+count_LRorRL(S))
Buggy python submission (verdict: Runtime Error):
input()
B = input()
k = int(input())
for v in B:
    print(B if k[k-1] == B else "*",end="")


Fixed submission:
input()
B = input()
k = int(input())
for v in B:
    print(v if B[k-1] == v else "*",end="")

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = input()
k = int(input())
for v in B:
    print(B if k[k-1] == B else "*",end="")

Fixed submission:
input()
B = input()
k = int(input())
for v in B:
    print(v if B[k-1] == v else "*",end="")

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = input()
k = int(input())
for v in B:
    print(B if k[k-1] == B else "*")

Fixed submission:
input()
B = input()
k = int(input())
for v in B:
    print(v if B[k-1] == v else "*",end="")
Buggy python submission (verdict: Runtime Error):
a,b,c,d,e,k = [int,input()] for i range(6)]

print("Yay!" if abs(a-e) <= k else ":(" )

Fixed submission:
a,b,c,d,e,k=[int(input()) for i in range(6)]
print("Yay!" if abs(a-e)<=k else ":(")

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

print("Yay!" if A <= A[5] else ":(" )

Fixed submission:
a,b,c,d,e,k=[int(input()) for i in range(6)]
print("Yay!" if abs(a-e)<=k else ":(")
Buggy python submission (verdict: Runtime Error):
a = int(input())
print("T" if a == "A" else "A" if a == "T" else "G" if a == "C" else "C")

Fixed submission:
a = input()
print("T" if a == "A" else "A" if a == "T" else "G" if a == "C" else "C")
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input(),split())
print(a*b//2)


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

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


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

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


Fixed submission:
a,b,c = map(int,input().split())
print(a*b//2)
Buggy python submission (verdict: Runtime Error):
a = input()
print((((a-1)//111)+1)*111)

Fixed submission:
a = int(input())
print((((a-1)//111)+1)*111)
Buggy python submission (verdict: Runtime Error):
print(int(input())-int(input())+1)

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

Buggy python submission (verdict: Runtime Error):
print(int(input())-int(input())+1)

Fixed submission:
a,b = map(int,input().split())
print(a-b+1)
Buggy python submission (verdict: Runtime Error):
a,b = map(int(input().split()))
print((a-1)*(b-1))


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

Buggy python submission (verdict: Runtime Error):
a,b = map(int(input().split()))
print((a-1)*(b-1))


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

Buggy python submission (verdict: Runtime Error):
a,b = map(int(input()).split())
print((a-1)*(b-1))


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

Buggy python submission (verdict: Runtime Error):
a,b = map(int(input()).split())
print((a-1)*(b-1))


Fixed submission:
a,b = map(int,input().split())
print((a-1)*(b-1))
Buggy python submission (verdict: Runtime Error):
x,a,b = [int(input) for i in range(3)]
print((x-a)%b)


Fixed submission:
x,a,b = [int(input()) for i in range(3)]
print((x-a)%b)
Buggy python submission (verdict: Runtime Error):
print("Yes" if sorted(int(input())) < sorted(int(input()))[::-1] else "No")

Fixed submission:
print("Yes" if sorted((input())) < sorted((input()))[::-1] else "No")
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print("YES" if a[-1] == b[0] and b[-1] == c[0] else "NO")

Fixed submission:
a,b,c = input().split()
print("YES" if a[-1] == b[0] and b[-1] == c[0] else "NO")
Buggy python submission (verdict: Runtime Error):
a,b,c = input().split()
print(a,b,c)

Fixed submission:
a,b,c = input().split(",")
print(a,b,c)
Buggy python submission (verdict: Runtime Error):
n = input().split()
print("YES") if n.count("5") ==2 and n.count("7") == 1 else "NO")

Fixed submission:
n = input().split()
print("YES" if n.count("5") ==2 and n.count("7") == 1 else "NO")
Buggy python submission (verdict: Runtime Error):
N,L = map(int,input().split())
S = sorted([input() for i in range(n)])
print(*s,sep = "")


Fixed submission:
N,L = map(int,input().split())
S = sorted([input() for i in range(N)])
print(*S,sep = "")
Buggy python submission (verdict: Runtime Error):
N = input()
S = input()
K = input()

char = S[int(K)-1]

#print(char)

ans = []

for j in range(len(S)):
  #print(S[j])
  if char != S[j]:
    #print(S[j])
    S_t =S.replace(S[j], "*")
    #print(S_t)
    #print("!=") 
    S = S_t 
  else:
    #ans.append(char)
    continue

#print(" ".join(ans))
print(S_t)



Fixed submission:
N = input()
S = input()
K = input()

char = S[int(K)-1]

#print(char)

ans = []

for j in range(len(S)):
  #print(S[j])
  if char != S[j]:
    ans.append("*")
    #print("!=")   
  else:
    ans.append(char)
    continue

print("".join(ans))
Buggy python submission (verdict: Runtime Error):
N = int(input())
L0 = 2
L1 = 1
for i in range(N-1):
  ans = L0 + L1
  L0 = L1
  L1 = ans
  
print(ans)

Fixed submission:
N = int(input())
L0 = 2
L1 = 1
if N == 1:
  	ans = 1

else:
	for i in range(N-1):
		ans = L0 + L1
		L0 = L1
		L1 = ans
print(ans)