Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# 組み合わせを全て考える
# タイムアウトになった
N = int(input())
S = input()
L = []
import itertools
seq = [i for i in range(N)]
combi = list(itertools.combinations(seq,3))
for c in combi:
    x = [S[j] for j in c]
    L.append("".join(x))
print(len(set(L)))

Fixed submission:
def solve():
    ans = 1
    N = int(input())
    s = input()
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = input()
def solve():
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()

Fixed submission:
def solve():
    ans = 1
    N = int(input())
    s = input()
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
def solve():
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()

Fixed submission:
def solve():
    ans = 1
    N = int(input())
    s = input()
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
L = []
import itertools
seq = [i for i in range(N)]
combi = list(itertools.combinations(seq,3))
for c in combi:
    x = [S[j] for j in c]
    L.append("".join(x))
print(len(set(L)))

Fixed submission:
def solve():
    ans = 1
    N = int(input())
    s = input()
    ans = 0
    for i in range(1000):
        t = str(i).zfill(3)
        t_index = 0 
        for s_index in range(N):
            if s[s_index] == t[t_index]:
                t_index += 1
                if t_index == 3:
                    break
        if t_index == 3:
            ans += 1
    print(ans)
solve()
Buggy python submission (verdict: Runtime Error):
N = input()

print(N*N*N)

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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)


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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)

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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)

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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int, input.split())
b = map(int, input.split())
c = map(int, input.split()) 
former = -10
satisfy = 0
for i in a:
    print(i)
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)



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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)

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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-1]
    former = i
print(satisfy)

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

former = -10
satisfy = 0
for i in a:
    satisfy += b[i-1]
    if i == former + 1:
        satisfy += c[i-2]
    former = i
print(satisfy)
Buggy python submission (verdict: Runtime Error):
N = int(input())
B = map(int, input().split())
A = [B[0]]
for i in range(1, N-1):
    A.append(min(B[i], B[i-1]))
A.append(B[N-2])
print(sum(A))

Fixed submission:
N = int(input())
B = list(map(int, input().split()))
A = [B[0]]
for i in range(1, N-1):
    A.append(min(B[i], B[i-1]))
A.append(B[N-2])
print(sum(A))
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = input()
count = 0
for i in range(1, N):
  if S[i] == S[i - 1]:
    c += 1
print(min(N - 1, count + K * 2))

Fixed submission:
N, K = map(int, input().split())
S = input()
count = 0
for i in range(1, N):
  if S[i] == S[i - 1]:
    count += 1
print(min(N - 1, count + K * 2))

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

def result(S):
    count = 0
    for i in range(len(S)-1):
        if S[i]==S[i+1]:
            count += 1
    return count
  
def reverse(S, l, r):
    for i in range(l-1, r):
        if S[i] == "R":
            S[i] = "L"
        else:
            S[i] = "R"
        return S
M = 0
for k in range(K):
  for r in range(1, N+1):
      for l in range(1, r+1):
          new = result(reverse(S))
          if new > M:
              M = new
print(new)

Fixed submission:
N, K = map(int, input().split())
S = input()
count = 0
for i in range(1, N):
  if S[i] == S[i - 1]:
    count += 1
print(min(N - 1, count + K * 2))

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

def result(S):
    count = 0
    for i in range(len(S)-1):
        if S[i]==S[i+1]:
            count += 1
    return count
  
def reverse(S, l, r):
    for i in range(l-1, r):
        if S[i] == "R":
            S[i] = "L"
        else:
            S[i] = "R"
        return S
M = 0
for r in range(1, N+1):
    for l in range(1, r+1):
        new = result(reverse(S))
        if new > M:
            M = new
print(new)


Fixed submission:
N, K = map(int, input().split())
S = input()
count = 0
for i in range(1, N):
  if S[i] == S[i - 1]:
    count += 1
print(min(N - 1, count + K * 2))
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as  np
import math
 
def get_sieve_of_eratosthenes(n):
    prime = []
    limit = math.sqrt(n)
    data = [i + 1 for i in range(1, n)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e % p != 0]
 
 
x = int(input())
data = get_sieve_of_eratosthenes(x+100000000)
data = np.array(data)
indices = np.where(data > x)[0]
# print(indices)
print(data[indices[0]])
 

Fixed submission:
import numpy as  np
import math

def get_sieve_of_eratosthenes(n):
    prime = []
    limit = math.sqrt(n)
    data = [i + 1 for i in range(1, n)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e % p != 0]


x = int(input())
data = get_sieve_of_eratosthenes(x+100)
data = np.array(data)
indices = np.where(data >= x)[0]
# print(indices)
print(data[indices[0]])
Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())

count = 0
for _, s, t in enumerate(zip(S,T)):
    if s == t:
        count += 1

print(count)

Fixed submission:
S = str(input())
T = str(input())

count = 0
for _, (s, t) in enumerate(zip(S,T)):
    if s == t:
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
string = input()
result = []
j=0
for i in range(len(string)):
    if string[i]=='0':
        result.append('0')
    elif string[i]=='1':
        result.append('1')
    elif string[i]=='B' and len(result)>1 and result[-1] in ['0','1']
        result[-1]=""
str_result="".join(result)
print(str_result)


Fixed submission:
string = input()
result = []
j=0
for i in range(len(string)):
    if string[i]=='0':
        result.append('0')
    elif string[i]=='1':
        result.append('1')
    elif string[i]=='B' and len(result)>=1 and result[-1] in ['0','1']:
        del result[-1]
str_result="".join(result)
print(str_result)
Buggy python submission (verdict: Runtime Error):
S = int(input())

if S == 'Sunny':
  print('Cloudy')
  
if S == 'Cloudy':
  print('Rainy')
  
if S == 'Rainy':
  print('Sunny')
 

Fixed submission:
S = input()

if S == 'Sunny':
  print('Cloudy')
  
if S == 'Cloudy':
  print('Rainy')
  
if S == 'Rainy':
  print('Sunny')
Buggy python submission (verdict: Runtime Error):
a,s = int(input())

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

else:a < 3200
    print('red')

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

if a >= 3200:
    print(s)

if a < 3200:
    print('red')
Buggy python submission (verdict: Runtime Error):
D = int(input())

if D = 25:
  print('Christmas')
  
if D = 24:
  print('Christmas Eve')
  
if D = 23:
  print('Christmas Eve Eve')
  
if D = 22:
  print('Christmas Eve Eve Eve')

Fixed submission:
D = int(input())

if D == 25:
  print('Christmas')
  
if D == 24:
  print('Christmas Eve')
  
if D == 23:
  print('Christmas Eve Eve')
  
if D == 22:
  print('Christmas Eve Eve Eve')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())

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

if N == 2:
    print(A + B)

Fixed submission:
N = int(input())

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

else:
     A = int(input())
     B = int(input())
     print(A + B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())

if N == 1:
    print('Hello Would')

if N == 2:
    print(A + B)

Fixed submission:
N = int(input())

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

else:
     A = int(input())
     B = int(input())
     print(A + B)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = [int(x) for x in input().split()]
for i in range(k):
    if a!=0:
        a-=1
        k-=1
    else:
        b-=1
        k-=1
print(str(a)+" "+str(b))

Fixed submission:
a, b, k = [int(x) for x in input().split()]
if a<=k:
    k -= a
    a = 0
    if b<=k:
        k -= b
        b = 0
    elif b>k:
        b -= k
        k = 0
else:
    a -= k
    k = 0
print(str(a)+" "+str(b))
Buggy python submission (verdict: Runtime Error):
S,T=map(str,input().split())
print(f"{T}{S}")

Fixed submission:
S,T=map(str,input().split())
print("{}{}".format(T,S))
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K=map(int,input().split())
for num in range(K):
    if A>=1:
        A-=1
    elif B>=1:
        B-=1
    else:
        pass
print("{} {}".format(A,B))

Fixed submission:
A,B,K=map(int,input().split())
if A-K>=0:
    print("{} {}".format(A-K,B))
elif A+B-K>=0:
    print("0 {}".format(A+B-K))
else:
    print("0 0")

Buggy python submission (verdict: Runtime Error):
a, b, k = map(float(), input().split(" "))
if a+b <= k:
  print("0 0")
elif a >= k:
  print(f'{a-k} 0')
else:
  print(f'0 {(a+b)-k}')

Fixed submission:
a, b, k = map(int, input().split(" "))
if a+b <= k:
  print('0 0')
elif a >= k:
  c = a-k
  print(c, ' ', b)
else:
  c = (a+b)-k
  print('0 ', c)

Buggy python submission (verdict: Runtime Error):
a, b, k = input().split(" ")
if a+b <= k:
  print("0 0")
elif a >= k:
  print(f'{a-k} 0')
else:
  print(f'0 {(a+b)-k}')

Fixed submission:
a, b, k = map(int, input().split(" "))
if a+b <= k:
  print('0 0')
elif a >= k:
  c = a-k
  print(c, ' ', b)
else:
  c = (a+b)-k
  print('0 ', c)
Buggy python submission (verdict: Runtime Error):
def isPrime(n):
  if n == 2:
    return True
  for p in range(2, n):
      if n % p == 0:
        return False
  return True

x = float(input())
while True:
  if isPrime(x):
    print(x)
    break
  x = x+1

Fixed submission:
def isPrime(n):
  if n == 2:
    return True
  for p in range(2, n):
      if n % p == 0:
        return False
  return True
 
x = int(input())
while True:
  if isPrime(x):
    print(x)
    break
  x = x+1

Buggy python submission (verdict: Runtime Error):
x = int(input())
while True:
  if isPrime(x):
    print(x)
    break
  x = x+1
  
def isPrime(n):
  if n < 2:
    return False
  if n == 2:
    return True
  for p in range(2, n):
      if n % p == 0:
        return False
  return True

Fixed submission:
def isPrime(n):
  if n == 2:
    return True
  for p in range(2, n):
      if n % p == 0:
        return False
  return True
 
x = int(input())
while True:
  if isPrime(x):
    print(x)
    break
  x = x+1
Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int, input().split())

count = 0

for _ in range(k):
  if a>=1:
    a -= 1
  elif a==0 and b >= 1:
      b -= 1

print(a, b)


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

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

for _ in range(k):
  if a>=1:
    a -= 1
  elif a==0:
    if b >= 1:
      b -= 1
  else:
    pass
  
print(a, b)

Fixed submission:
a,b,k=map(int,input().split())
print(max(a-k,0),max(0,b-max(k-a,0)) )
Buggy python submission (verdict: Runtime Error):
def is_prime(num):
  for i in range(num):
    if num % i == 0:
      return False
  return True

x = int(input())

for i in range(x, 10000+4):
  if is_prime(i):
    print(i)
    break

Fixed submission:
def is_prime(num):
  for i in range(2, num):
    if num % i == 0:
      return False
 
  return True

x = int(input())

for i in range(x, 100004):
  if is_prime(i):
    print(i)
    break
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

s = []
L = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
L += L

for i in S:
  s += a[a.find(c) + N]
  
print(*s, sep="")

Fixed submission:
N = int(input())
L = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
S = input()
res = ""

for i in S:
  n = ord(i)
  n = n + N
  if n > ord("Z"):
    n -= 26
  res += L[n - ord("A")]
  
print(res)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

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


if N/2!=N//2:
  print("No")

if v[0] == v[1]:
  print("Yes")
else:
  print("No")





Fixed submission:
n = int(input())
s = [i for i in input()]

if n%2 == 1:
  print("No")
else:
  if s[:int(n/2)] == s[int(n/2):]:
    print("Yes")
  else:
    print("No")

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

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

if v[0] == v[1]:
  print("Yes")
else:
  print("No")




Fixed submission:
n = int(input())
s = [i for i in input()]

if n%2 == 1:
  print("No")
else:
  if s[:int(n/2)] == s[int(n/2):]:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import itertools 
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]

l = 0
c = 0

for v in itertools.permutations(xy):
  for i in range(len(v)-1):
    l += ((v[i][0] - v[i+1][0])**2 + v[i][1] - v[i+1][1])**2)**0.5
  c += 1
  
print(l/c)

Fixed submission:
import itertools 
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]

l = 0
c = 0

for v in itertools.permutations(xy):
  for i in range(len(v)-1):
    l += ((v[i][0] - v[i+1][0])**2 + (v[i][1] - v[i+1][1])**2)**0.5
  c += 1

print(l/c)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
List = []

for i in range(N):
  print(str(A.index(i+1)+1), end=" ")






Fixed submission:
N = int(input())

if N == 1:
  print(1)
elif N % 2 == 1:
  print(((N-1)/2+1)/N)
elif N % 2 == 0:
  print(1/2)

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

if N % 2 == 1:
  print(((N-1)/2+1)/N/)
else:
  print(N/2)

Fixed submission:
N = int(input())

if N == 1:
  print(1)
elif N % 2 == 1:
  print(((N-1)/2+1)/N)
elif N % 2 == 0:
  print(1/2)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())

a = 1
count = 0

while True:
  if a >= B:
    print(count)
    exit()
  a = a - 1 + A
  cnt += 1

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

if C % (A-1) == 0:
  print(C//(A-1)+1)
elif C % (A-1) != 0 :
  print(C//(A-1)+2)
Buggy python submission (verdict: Runtime Error):
N = int(input())

l = list(range(1,N+1)) 
I = list(range(1,N))
l.pop(0)

print(sum([x % y for (x,y) in zip(I, l)]))





Fixed submission:
N  =int(input())
print(N*(N-1)//2)

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

l = list(range(1,N+1)) ## 1~Nのリスト
I = list(range(1,N))
l.pop(0)

print(sum([x % y for (x,y) in zip(I, l)]))




Fixed submission:
N  =int(input())
print(N*(N-1)//2)

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

l = list(range(1,N+1)) ## 1~Nのリスト
I = list(range(1,N+1))

a = l.pop(0)
l.append(a)

print(sum([x % y for (x,y) in zip(I, l)]))




Fixed submission:
N  =int(input())
print(N*(N-1)//2)

Buggy python submission (verdict: Runtime Error):
import copy
N = int(input())

l = list(range(1,N+1)) ## 1~Nのリスト
I = compy.deepcopy(l)

a = l.pop(0)
l.append(a)

print(sum([x % y for (x,y) in zip(I, l)]))




Fixed submission:
N  =int(input())
print(N*(N-1)//2)

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

l = list(range(1,N+1)) ## 1~Nのリスト
I = list(range(1,N+1))

a = l.pop(0)
l.append(a)

L= [x % y for (x,y) in zip(I, l)]

print(sum(L))

Fixed submission:
N  =int(input())
print(N*(N-1)//2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
p = list(map(int, input().split()))

count = 0

for i in range(n-1):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    count += 1
    
print(count)


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

count = 0

for i in range(n-2):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    count += 1
    
print(count)

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

count = 0

for i in range(n):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    ans += 1
    
print(ans)


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

count = 0

for i in range(n-2):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    count += 1
    
print(count)

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

count = 0

for i in range(len(n)-1):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    ans += 1
    
print(ans)

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

count = 0

for i in range(n-2):
  if p[i]<p[i+1]<p[i+2] or p[i+2]<p[i+1]<p[i]:
    count += 1
    
print(count)
Buggy python submission (verdict: Runtime Error):
n, x = map(int, input().split())
l = map(int, input().split())

d = 0
c = 0
for i in range(n):
  d += l[i]
  if d < x:
    c += 1
  else:
    break
    
print(c)

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

d = 0
c = 1

for i in range(n):
  d += l[i]
  if d <= x:
    c += 1

    
print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
w = list(map(int, input().split()))
l = []

for i in range(1, n):
  l.append(abs( sum(w[:t]) -sum(w[t:]) ))
  
print(min(l))

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

for i in range(1, n):
  l.append(abs( sum(w[:i]) -sum(w[i:]) ))
  
print(min(l))

Buggy python submission (verdict: Runtime Error):
n = int(input())
w = list(map(int, input().split()))
l = []

for i in range(1, n):
  l.append(abs(sum(w[i:]) - sum(w[:t])))
  
print(min(l))

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

for i in range(1, n):
  l.append(abs( sum(w[:i]) -sum(w[i:]) ))
  
print(min(l))
Buggy python submission (verdict: Runtime Error):
r,d,x = map(int, input().split())

for i in range(10):
  x += r*x - d
  printx(x)
  

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

count = 0
while count < 10:
  x = r*x-d
  print(x)
  count += 1

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

for i in range(10):
  x += r*x - D
  printx(x)
  

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

count = 0
while count < 10:
  x = r*x-d
  print(x)
  count += 1
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
s = input()

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

print("".join(s))

Fixed submission:
n,k=map(int,input().split())
s=input()
print(s[:k-1]+s[k-1].lower()+s[k:])

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

print(s.replace(s[k], s[k].lower()))


Fixed submission:
n,k=map(int,input().split())
s=input()
print(s[:k-1]+s[k-1].lower()+s[k:])
Buggy python submission (verdict: Runtime Error):
a,b,c,d = str(input())

if 1<=int(a+b)<=12 and 1<=int(c+d)<=12:
  print("AMBIGUOUS")
elif 1<=int(a+b)<=12 
  print("MMYY")
elif 1<=int(c+d)<=12 
  print("YYMM")
else:
  print("NA")


Fixed submission:
a,b,c,d = str(input())

if 1<=int(a+b)<=12 and 1<=int(c+d)<=12:
  print("AMBIGUOUS")
elif 1<=int(a+b)<=12: 
  print("MMYY")
elif 1<=int(c+d)<=12: 
  print("YYMM")
else:
  print("NA")
Buggy python submission (verdict: Runtime Error):
N, T = map(int, input.split())
c_max = 1001

for i in range(N):
  c,t = map(int, input.split())
  if t <=T:
    c_max=min(c_max, c)
print("TLE" if c_max==1001 else c)

Fixed submission:
N,T=map(int,input().split())
m=1001
for i in range(N):
    c,t=map(int,input().split())
    if t<=T:m=min(m,c)
print("TLE" if m==1001 else m)
Buggy python submission (verdict: Runtime Error):
n,m,x,y = map(int,input().split())
y = list(map(int, input().split()) for _ in range(n))
x = list(map(int, input().split()) for _ in range(n))

x = sorted(x)
y = sorted(y)

if y[0]<x[-1]:
  print("War")
else:
  print("No War")

Fixed submission:
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

x = sorted(x)
y = sorted(y)

if max(x[-1], X) < min(y[0], Y):
  print("No War")
else:
  print("War")