Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# Your code here!

counter = 0

string = input()

while (string.find("01") != -1 ) :
    string = (string.replace("01", "", 1))
    counter += 2

while (string.find("10") != -1 ) :
    string = (string.replace("10", "", 1))
    counter += 2
    
print(counter)

Fixed submission:
# coding: utf-8
# Your code here!

counter = 0

string = input()

num_0 = string.count("0")
num_1 = string.count("1")

print(min(num_0, num_1)*2)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# Your code here!

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

s = [int(input()) for i in range(A)]
t = [int(input()) for i in range(B)]
x = [int(input()) for i in range(Q)]

for i in x : 
    min_s = abs(i -s[0])
    j_count = 0
    j_k_count = 0
    min_t = abs(i -t[0])
#    min_t_s = abs(i -s[0])
    k_count = 0
    k_j_count = 0
#Sから攻める
    for j in s : 
        if abs(i-j) <= min_s : 
            min_s = abs(i-j)
            j_count = j
            
    min_s_t = abs(j_count -t[0])
            
    for k in t : 
        if abs(j_count-k) <= min_s_t : 
            min_s_t = abs(j_count-k)
            j_k_count = k
    min0 = abs(i-j_count)+abs(j_count-j_k_count)

# ---------------------------------------------

    for m in t : 
        if abs(i-m) <= min_t : 
            min_t = abs(i-m)
            m_count = m
            
    min_t_s = abs(m_count -s[0])
            
    for n in s : 
        if abs(m_count-n) <= min_t_s : 
            min_t_s = abs(m_count-n)
            m_n_count = n
    min1 = abs(i-m_count)+abs(m_count-m_n_count)

#小さい方採用

    print(min(min0, min1))
    

Fixed submission:
import bisect

A, B, Q = map(int, input().split())
INF = 10 ** 18

s = [-INF] + [int(input()) for i in range(A)] + [INF]
t = [-INF] + [int(input()) for i in range(B)] + [INF]


for q in range(Q):
    x = int(input())
    b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
    res = INF
    for S in [s[b-1], s[b]] : 
        for T in [t[d-1], t[d]] : 
            d1, d2 = abs(S-x) + abs(T-S), abs(T-x) + abs(S-T)
            res = min(res, d1, d2)
    print(res)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())

if N < M : 

    X = sorted(list(map(int, input().split())))
    
    move = []
    
    for i in range(len(X)-1) : 
        move.append(X[i+1] -X[i])
        
    # print(move)
    
    for i in range(N-1) : 
        move.pop(move.index(max(move)))
    
    # print(move)
    
    sum = 0
    
    for i in move : 
        sum += i

else : 
    sum = 0
    
print(sum)

Fixed submission:
from collections import deque

N, M = map(int, input().split())

if N < M : 

    X = sorted(list(map(int, input().split())))
    
    move = []
    
    for i in range(len(X)-1) : 
        move.append(X[i+1] -X[i])
        
    # print(move)

    move = sorted(move)    

    # print(move)
    
    sum = 0
    
    for i in range(M-N) : 
        sum += move[i]

else : 
    sum = 0
    
print(sum)

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

if N < M : 

    X = list(map(int, input().split()))
    
    X = sorted(X)
    
    move = []
    
    for i in range(len(X)-1) : 
        move.append(X[i+1] -X[i])
        
    # print(move)
    
    for i in range(N-1) : 
        move.pop(move.index(max(move)))
    
    # print(move)
    
    sum = 0
    
    for i in move : 
        sum += i

else : 
    sum = 0
    
print(sum)

Fixed submission:
from collections import deque

N, M = map(int, input().split())

if N < M : 

    X = sorted(list(map(int, input().split())))
    
    move = []
    
    for i in range(len(X)-1) : 
        move.append(X[i+1] -X[i])
        
    # print(move)

    move = sorted(move)    

    # print(move)
    
    sum = 0
    
    for i in range(M-N) : 
        sum += move[i]

else : 
    sum = 0
    
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

l = list(map(int,input().split()))

l.sort(reverse = True)
ans = 1
for i in range(n):
    ans *= l[i]
    if ans > 10**18:
      ans = -1
      break
    if 0 in l:
      ans = 0
      break

print(ans)

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

l.sort(reverse = True)
ans = l[-1]
for i in range(n-1):
    ans *= l[i]
    if ans > 10**18:
      ans = -1
      break
    elif ans == 0:
      ans = 0
      break

print(ans)

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

l = list(map(int,input().split()))

ans = 1
for i in range(n):
    ans *= l[i]
    if ans > 10**18:
      ans = -1
      break
    elif 0 in l:
      ans = 0
      break
    else:
      continue

print(ans)


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

l.sort(reverse = True)
ans = l[-1]
for i in range(n-1):
    ans *= l[i]
    if ans > 10**18:
      ans = -1
      break
    elif ans == 0:
      ans = 0
      break

print(ans)

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

l = list(map(int,input().split()))

ans = 1
for i in range(n):
    ans *= l[i]

if ans > 10**18:
  ans = -1

print(ans)


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

l.sort(reverse = True)
ans = l[-1]
for i in range(n-1):
    ans *= l[i]
    if ans > 10**18:
      ans = -1
      break
    elif ans == 0:
      ans = 0
      break

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

if n >= 10:
    print(r)
else:
    r += 100*(10-n)
    print(r)2

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

if n >= 10:
    print(r)
else:
    r += 100*(10-n)
    print(r)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [str(input()) for _ in range(n)]

S = set(s)
c_m = int(0)
l = []

for i in range(len(S)):
    a = S.pop()
    c_i = int(s.count(a))
    if c_i > c_m:
        c_m = c_i
        l = [a]
    elif c_i == c_m:
        l.append(a)

l.sort()
for i in range(len(l)):
  print(l[i])


Fixed submission:
n = int(input())
d = dict()
for _ in range(n):
    x = str(input())
    if x in d:
        d[x] += 1
        continue
    else:
        d[x] = 0

d_sort = sorted(d.items(), key=lambda d:d[1], reverse = True)
d_max = d_sort[0][1]

ans = []
for i in d_sort:
    if d_max == i[1]:
        ans.append(i[0])
    else:
        break

ans.sort()
for a in ans:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = sorted([str(input()) for _ in range(n)])

S = set(s)
c_m = int(0)
l = []

for i in range(len(S)):
    a = S.pop()
    c_i = int(s.count(a))
    if c_i > c_m:
        c_m = c_i
        l = [a]
    elif c_i == c_m:
        l.append(a)

l.sort()
for i in range(len(l)):
  print(l[i])


Fixed submission:
n = int(input())
d = dict()
for _ in range(n):
    x = str(input())
    if x in d:
        d[x] += 1
        continue
    else:
        d[x] = 0

d_sort = sorted(d.items(), key=lambda d:d[1], reverse = True)
d_max = d_sort[0][1]

ans = []
for i in d_sort:
    if d_max == i[1]:
        ans.append(i[0])
    else:
        break

ans.sort()
for a in ans:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = sorted([str(input()) for _ in range(n)])

S = set(s)
c_m = int(0)
l = []
ans = []
ans1 = []

for i in range(len(S)):
    a = S.pop()
    c_i = int(s.count(a))
    if c_i >= c_m:
        c_m = c_i
        l.append([c_m, a])
        continue

l.sort(reverse = True)
for i in range(len(l)):
    if l[0][0] == l[i][0]:
        ans.append(l[i][1])
        ans1 = sorted(ans)

for i in range(len(ans1)):
  print(ans1[i])


Fixed submission:
n = int(input())
d = dict()
for _ in range(n):
    x = str(input())
    if x in d:
        d[x] += 1
        continue
    else:
        d[x] = 0

d_sort = sorted(d.items(), key=lambda d:d[1], reverse = True)
d_max = d_sort[0][1]

ans = []
for i in d_sort:
    if d_max == i[1]:
        ans.append(i[0])
    else:
        break

ans.sort()
for a in ans:
    print(a)
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())

p = list(map(int,input().split()))

for i in range(n-k):
    if p[i] < p[i+k]:
        ans = p[i+1:k+i+1]
        
ans = sum(ans)
ans = (ans+k)/2

print(ans)


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

p = list(map(int,input().split()))

a = 0

for i in range(k):
    a += p[i]

ans = a

for i in range(n-k):
    a -= p[i]
    a += p[i+k]
    if a > ans:
        ans = a

ans = (ans+k)/2

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

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

p = list(map(int,input().split()))

a = deque(p[:k])
ans = sum(a)

for i in range(n-k):
    a.popleft()
    a.append(p[i+k])
    A = sum(a)
    if A > ans:
        ans = A
        continue

ans = (ans+k)/2

print(ans)

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

p = list(map(int,input().split()))

a = 0

for i in range(k):
    a += p[i]

ans = a

for i in range(n-k):
    a -= p[i]
    a += p[i+k]
    if a > ans:
        ans = a

ans = (ans+k)/2

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int,input().split())

p = list(map(int,input().split()))

y = 0
z = []

for i in range(n-k+1):
    x = 0
    for j in range(i,k+i):
        x += (1 + p[j])/2
    z.append(x)
    if x > y:
        y = x


print(y)


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

p = list(map(int,input().split()))

a = 0

for i in range(k):
    a += p[i]

ans = a

for i in range(n-k):
    a -= p[i]
    a += p[i+k]
    if a > ans:
        ans = a

ans = (ans+k)/2

print(ans)
Buggy python submission (verdict: Runtime Error):
x = int(input())

while True:
    c = 0
    for i in range(2, x+1):
        if x % i == 0:
            c += 1
    if cnt == 1:
        print(x)
        exit()
    else:
        x += 1


Fixed submission:
x = int(input())

while True:
    c = 0
    for i in range(2, x+1):
        if x % i == 0:
            c += 1
    if c == 1:
        print(x)
        exit()
    else:
        x += 1
Buggy python submission (verdict: Runtime Error):
import math
from fractions import gcd

a, b = map(int, input().split())

n = math.gcd(a, b)

if n == 1:
  print(a*b)
else:
  a = a//n
  print(a*b)


Fixed submission:
import fractions

a, b = map(int, input().split())

n = fractions.gcd(a, b)

if n == 1:
  print(a*b)
else:
  a = a//n
  print(a*b)
Buggy python submission (verdict: Runtime Error):
s = str(input())s = str(input())

l = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(1,8):
    if s == l[i-1]:
        print(8-i)


Fixed submission:
s = str(input())

l = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(1,8):
    if s == l[i-1]:
        print(8-i)
Buggy python submission (verdict: Runtime Error):
n = int(input())

d = list(map(int,input().split())

for i in range(n):
    for j in range(n):
        if i == j:
            break
        else:
            s += d[i] * d[j]

print(s)

Fixed submission:
n = int(input())

d = list(map(int,input().split()))

s = int(0)

for i in range(n):
    for j in range(i,n):
        if i == j:
            continue
        else:
            s += d[i] * d[j]

print(s)

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

s = int(0)
s += d[0] * d[n]

for i in range(1,n):
    s += d[n-1] * d[n]

print(s)


Fixed submission:
n = int(input())

d = list(map(int,input().split()))

s = int(0)

for i in range(n):
    for j in range(i,n):
        if i == j:
            continue
        else:
            s += d[i] * d[j]

print(s)

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

s = int(0)

s += d[0] * d[n]


for i in range(n):
    s += d[n] * d[n+1]

print(s)

Fixed submission:
n = int(input())

d = list(map(int,input().split()))

s = int(0)

for i in range(n):
    for j in range(i,n):
        if i == j:
            continue
        else:
            s += d[i] * d[j]

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

A = [int,input() for i in range(q)]

a = q-k+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a and v > 0:
        print('Yes')
    else:
        print('No')


Fixed submission:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
n = [K - Q] * N
for i in range(Q):
    n[A[i]-1] += 1
for i in range(N):
    if n[i] > 0:
        print('Yes')
    else:
        print('No')

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

A = [int,input() for i in range(q)]

a = q-k+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a and v > 0:
        print('Yes')
    else:
        print('No')


Fixed submission:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
n = [K - Q] * N
for i in range(Q):
    n[A[i]-1] += 1
for i in range(N):
    if n[i] > 0:
        print('Yes')
    else:
        print('No')

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

A = [int,input() for i in range(q)]

a = q-k+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a:
        print('Yes')
    else:
        print('No')

Fixed submission:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
n = [K - Q] * N
for i in range(Q):
    n[A[i]-1] += 1
for i in range(N):
    if n[i] > 0:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
a = int(input())

b = int(input())

ans = int(0)

for i in range(1,21):
    if b > a*i-i+1:
            ans += 1
    else:
            ans += 1
            break

print(ans)


Fixed submission:
s = list(input())

t = list(input())

ans = int(0)

for i in range(3):
    if s[i]==t[i]:
            ans += 1 
        
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())

b = int(input())

ans = int(0)

for i in range(1,21):
    if b > a*i-i+1:
            ans += 1
    else:
            ans += 1
            print(ans)
            break

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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and 1 == b:
        print(0)
        break
    else:
        print(i+1)
        break

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

b = int(input())

ans = int(0)

for i in range(1,21):
    if b > a*i-i+1:
            ans += 1
    else:
            ans += 1
            print(ans)
            break

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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and 1 == b:
        print(0)
        break
    else:
        print(i+1)
        break

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

b = int(input())

ans = int(0)

for i in range(1,21):
    if b > a*i-i+1:
            ans += 1
    else:
            ans += 1
            break

print(ans)


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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and 1 == b:
        print(0)
        break
    else:
        print(i+1)
        break

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

b = int(input())

ans = int(0)

for i in range(21):
    if b > a*i-i+1:
            ans += 1
    else:
            break

print(ans)


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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and 1 == b:
        print(0)
        break
    else:
        print(i+1)
        break

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

b = int(input())

ans = int(0)

for i in range(21):
    if b > a*i-i:
            ans += 1
    else:
            break

print(ans)


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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and 1 == b:
        print(0)
        break
    else:
        print(i+1)
        break
Buggy python submission (verdict: Runtime Error):
k, x = map(int,input().spit())

L = []

for i in range(k*2-1):
    print(x-k+1+i,end=' ')


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

for i in range(k*2-1):
    print(x-k+1+i,end=' ')
Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int,input().split())
for i in range(10**9+1):
    if abs(a-i) == abs(b-i):
            print(i)
            break
    elif a<i and b<i and abs(a-i) != abs(b-i):
            print('IMPOSSIBLE')
            break

Fixed submission:
a, b = map(int,input().split())
x = (a+b)%2
if x == 0:
    print((a+b)//2)
else:
    print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
n = int(input())

a = [int(input()) for i in range(n)]

x = int(0)
y = int(0)

for i in range(n):
    x = max(a[:i])
    y = max(a[i + 1:])
    print(max(x,y))

Fixed submission:
r = int(input())

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

a = [int(input()) for i in range(n)]

x = int(0)
y = int(0)

for i in range(n):
    x = max(0,a[:i])
    y = max(0,a[i + 1:])
    print(max(x,y))


Fixed submission:

n = int(input())
a = []
y = 0
for i in range(n):
    x = int(input())
    a.append(x)
    if y <= x:
        y = x
        m = i

a.sort(reverse = True)
a_1 = a[0]
a_2 = a[1]

if a_1 == a_2:
    for i in range(n):
        print(a_1)

else:
    for i in range(m):
        print(a_1)

    print(a_2)

    for j in range(m+1,n):
        print(a_1)

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

a = [int(input()) for i in range(n)]

for i in range(n):
    x = max(a[:i])
    y = max(a[i + 1:])
    print(max(x,y))


Fixed submission:

n = int(input())
a = []
y = 0
for i in range(n):
    x = int(input())
    a.append(x)
    if y <= x:
        y = x
        m = i

a.sort(reverse = True)
a_1 = a[0]
a_2 = a[1]

if a_1 == a_2:
    for i in range(n):
        print(a_1)

else:
    for i in range(m):
        print(a_1)

    print(a_2)

    for j in range(m+1,n):
        print(a_1)

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

a = [int(input()) for i in range(n)]

for i in range(n):
    print(max(max(a[:i],a[i+1:])))

Fixed submission:

n = int(input())
a = []
y = 0
for i in range(n):
    x = int(input())
    a.append(x)
    if y <= x:
        y = x
        m = i

a.sort(reverse = True)
a_1 = a[0]
a_2 = a[1]

if a_1 == a_2:
    for i in range(n):
        print(a_1)

else:
    for i in range(m):
        print(a_1)

    print(a_2)

    for j in range(m+1,n):
        print(a_1)
Buggy python submission (verdict: Runtime Error):
n = int(input())

L = [int(i) for i in input().split()]

for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer + 1
             continue
     if L[i+2]<L[i+1] and L[i+1]<L[i]:
             Answer = Answer + 1
             continue
print(Answer)

Fixed submission:
n = int(input())

L = [int(i) for i in input().split()]

Answer = int(0)
for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer + 1
             continue
     if L[i+2]<L[i+1] and L[i+1]<L[i]:
             Answer = Answer + 1
             continue
print(Answer)

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

L = [int(i) for i in input().split()]

Answer = int(0)
for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer +1
             continue
	print(Answer)


Fixed submission:
n = int(input())

L = [int(i) for i in input().split()]

Answer = int(0)
for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer + 1
             continue
     if L[i+2]<L[i+1] and L[i+1]<L[i]:
             Answer = Answer + 1
             continue
print(Answer)

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

L = [int(i) for i in input().split()]

Answer = int(0)
for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer +1
             continue
    print(Answer)

Fixed submission:
n = int(input())

L = [int(i) for i in input().split()]

Answer = int(0)
for i in range(n-2):
     if L[i]<L[i+1] and L[i+1]<L[i+2]:
             Answer = Answer + 1
             continue
     if L[i+2]<L[i+1] and L[i+1]<L[i]:
             Answer = Answer + 1
             continue
print(Answer)
Buggy python submission (verdict: Runtime Error):
N = int(input())

D = [int(i) for i in input().split()]

D2 = sorted(D)
A = D2[N//2]
B = D2[N//2+1]
print(abs(A-B))

Fixed submission:
N = int(input())

D = [int(i) for i in input().split()]

D2 = sorted(D)
A = D2[N//2-1]
B = D2[N//2]
print(abs(A-B))
Buggy python submission (verdict: Runtime Error):
s = input()
if n[0]==n[1] or n[1]==n[2] or n[2]==n[3]:
	print('Bad')
else:
	print('Good')

Fixed submission:
s = input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
	print('Bad')
else:
	print('Good')
Buggy python submission (verdict: Runtime Error):
num = input()
if num[0] < num[2]:
print('0')
else:
print('10')

Fixed submission:
num = input()
if num[0] < num[2]:
	print('0')
else:
	print('10')
Buggy python submission (verdict: Runtime Error):
n, x = map(int,input().split())

L = [map(int,input().split())]

ans = int(1)
t = int(0)
for i in range(n):
    t += L[i]
    if t <= x:
        ans += 1

print(ans)

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

L = list(map(int,input().split()))

ans = int(1)
t = int(0)
for i in range(n):
    t += int(L[i])
    if t <= x:
        ans += 1

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

l = []
for i in range(n):
  x,y = map(str,input().split())
  l.append((x,y, i))


L = []

for i in range(n):
  L.append((l[i][0], int(l[i][1]), l[i][2]))

L.sort(key = lambda L:L[1])

L.sort(key = lambda L:L[0])

for i in range(n):
  print(L[n][2] + 1)



Fixed submission:
n=int(input())
sp=[]
for i in range(n):
  x,y=input().split()
  sp.append([x,int(y),i+1])
  sp.sort(key=lambda x:(x[0],-x[1]))
for i in range(n):
  print(sp[i][2])
Buggy python submission (verdict: Runtime Error):
S = input()

a = 10*int(S[0])+int(S[1])
b = 10*int(S[2])+int(S[3])

if a>12 and b>12:
    print('NA')
elif a>12 and 1<=b<=12:
    print('YYMM')
elif 1<=a<=12 and b>12:
    print('MMYY')
else:
    print('AMBIGUOUS')


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

p = input()

print(p[:k-1] + p[k-1].lower() + p[k:])
Buggy python submission (verdict: Runtime Error):
n = int,input()

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
    if int(v[i])>int(c[i]):
       integer += int(v[i])-int(c[i])
       continue
print(integer)


Fixed submission:
A, B, T = map(int,input().split())

i = T//A
print(B*i)
Buggy python submission (verdict: Runtime Error):
n = int,input()

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
    if int(v[i])>int(c[i]):
		integer += int(v[i])-int(c[i])
		continue
	print(integer)


Fixed submission:
n = int(input())

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
	if int(v[i]) > int(c[i]):
		integer += int(v[i])-int(c[i])
print(integer)

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

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
    if int(v[i])>int(c[i]):
            integer += int(v[i])-int(c[i])
            continue
print(integer)


Fixed submission:
n = int(input())

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
	if int(v[i]) > int(c[i]):
		integer += int(v[i])-int(c[i])
print(integer)

Buggy python submission (verdict: Runtime Error):
n = int,input()
3
integer = int(0)
v = input().split()

c = input().split()
for i in range(n):
    if int(v[i])>int(c[i]):
            integer += int(v[i])-int(c[i])
            continue
    print(integer)


Fixed submission:
n = int(input())

integer = int(0)
v = input().split()

c = input().split()

for i in range(n):
	if int(v[i]) > int(c[i]):
		integer += int(v[i])-int(c[i])
print(integer)