Problem:


Score : 100 points

Problem Statement

You are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).
Print the string S after lowercasing the K-th character in it.

Constraints

1 ≤ N ≤ 50

1 ≤ K ≤ N

S is a string of length N consisting of A, B and C.

Input

Input is given from Standard Input in the following format:

N K
S

Output

Print the string S after lowercasing the K-th character in it.

Sample Input 1

3 1
ABC

Sample Output 1

aBC

Sample Input 2

4 3
CABA

Sample Output 2

CAbA



Sample input:
3 1
ABC


Sample output:
aBC

Submission status: Wrong Answer

Solution code:
S=input()
S1=int(S[0:2])
S2=int(S[2:4])
#print(S1,S2)
if S1==0 and S2==0:print("NA");exit()
if S1==0:print("YYMM");exit()
if S2==0:print("MMYY");exit()
if S1>12 and S2>12:print("NAa");exit()
if S1>12:print("YYMM");exit()
if S2>12:print("MMYY");exit()
print("AMBIGUOUS")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
a = input()
a = list(a)

if a[n[1]-1] == "A":
    a[n[1]-1] = "a"
if a[n[1]-1] == "B":
    a[n[1]-1] = "b"
if a[n[1]-1] == "C":
    a[n[1]-1] = "c"
for i in a:
    print(str(i))

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split())
S = input()
if K == 1:
    S1 = ''
else:
    S1 = S[:K-2]
S2 = S[K:]
target = S[K-1]
S3 = target.lower()
S = S1 + S3 + S2
print(S)

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
S = input()
SS = S[K-1].lower()

SSS = S.replace(S[K-1],SS)

print(SSS)

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()


s = ns()
s1 = int(s[:2])
s2 = int(s[2:])

if s1 == 0 and s2 > 12:
    ans = "NA"
elif s1 > 12 and s2 == 0:
    ans = "NA"
elif s1 == 0 and s2 == 0:
    ans = "NA"
elif s1 == 0:
    ans = "YYMM"
elif s2 == 0:
    ans = "MMYY"
elif s1 > 12 and s2 > 12:
    ans = "NA"
elif s1 > 12:
    ans = "YYMM"
elif s2 > 12:
    ans = "MMYY"
else:
    ans = "AMBIGUOUS"

print(ans)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

s = S[K-1]


print(S.replace(s, s.lower()))

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
s = input()
M=s[K-1].lower()
A = s.replace(s[K-1],M)
print(A)

Submission status: Wrong Answer

Solution code:
def solve():
    n, k = map(int, input().split())
    s = input()
    if len(s) > n:
        raise Exception('Error')
    s_n = s.replace(s[k-1], s[k-1].lower())
    print(s_n)

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
a = input()
a = list(a)

if a[n[1]-1] == "A":
    a[n[1]-1] = "a"
if a[n[1]-1] == "B":
    a[n[1]-1] = "b"
if a[n[1]-1] == "C":
    a[n[1]-1] = "c"
print(a)

Submission status: Wrong Answer

Solution code:

inp = input()
inp = inp.split()
n = int(inp[0])
k = int(inp[1])
s = input()

print(s[:k-1] + s[k-1].upper() + s[k:])

Submission status: Wrong Answer

Solution code:
n,k = map(int, input().split(" "))
s = input()
print(s[0:(k-2 if k-2 >= 0 else 0)]+s[k-1].lower()+s[k:n])

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
s=list(input())
if s[k-1]=="A":
  s[k-1]="a"
elif s[k-1]=="B":
  s[k-1]="b"
else:
  s[k-1]=="c"
s="".join(s)
print(s)

Submission status: Wrong Answer

Solution code:
n, k = input().split()
s = input()
n = int(n)
k = int(k)
print(s.replace(s[k-1], s[k-1].lower()))

Submission status: Wrong Answer

Solution code:
S=input()
if 1<=int(S[:2])<=12 and 13<=int(S[2:]) or int(S[2:])==0:
    print("MMYY")
elif 1<=int(S[2:])<=12 and (13<=int(S[:2]) or int(S[:2])==0):
    print("YYMM")
elif 1<=int(S[2:])<=12 and 1<=int(S[:2])<=12:
    print("AMBIGUOUS")
elif (13<=int(S[2:]) or int(S[2:]))==0 and (13<=int(S[:2]) or int(S[:])==0):
    print("NA")

Submission status: Wrong Answer

Solution code:
s = input()
if 0 < int(s[0:2]) <= 12 and 0 < int(s[2:4]) <= 12:
    print('AMBIGUOUS')
elif int(s[0:2]) > 12 and int(s[2:4]) > 12 or int(s[0:2]) == 0 or int(s[2:4]) == 0:
    print('NA')
elif 0 < int(s[0:2]) <= 12 and int(s[2:4]) > 12:
    print('MMYY')
else:
    print('YYMM')

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
s = input('')
t = s[k-1].lower()
print(t)

Submission status: Wrong Answer

Solution code:
N, K = list(map(int, input().split()))
s = input()
print(s.replace(s[K - 1], s[K - 1].lower()))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

S_new = S.replace(S[K-1], S[K-1].lower())
print(S_new)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

S_new = S.replace(S[K-1], S[K-1].lower())

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

ans = S.replace(S[K-1], S[K-1].lower())

print(ans)

Submission status: Wrong Answer

Solution code:
miu = input().split()
sella = input()

for x in range(0, int(miu[0])):
	if x == int(miu[1]):
		print(sella[x].lower(), end='')
	else:
		print(sella[x], end='')

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = input()

cnt = 0
S = ""
for c in s:
  print(c)
  if cnt == k-1:
    S = S + c.lower()
  else:
    S = S + c
  cnt = cnt + 1

print(S)

Submission status: Wrong Answer

Solution code:
n,k = map(int, input().split())
s=input()

if s[k-1].isupper():
    s = s.replace(s[k-1],s[k-1].lower())
else:
    s = s.replace(s[k-1],s[k-1].upper())
    
print(s)

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
S = str(input())
print(S.replace(S[k-1], S[k-1].lower()))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = str(input())

s_list = list(S)
print(s_list)

tmp = s_list[K-1]
s_list[K-1] = tmp.lower()

S = ''.join(s_list)

print(S)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

print(S[0:K-2]+S[K-1].lower()+S[K:N-1])

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split())
S = str(input())

if(S[K-1]=='A'):
  for i in range(N):
    if(i==K-1):
      print('a',end='')
    else:
      print(S[i], end='')
elif(S[K-1]=='B'):
  for i in range(N):
    if(i==K-1):
      print('b',end='')
    else:
      print(S[i],end='')
else:
  for i in range(N):
    if(i==K-1):
      print('a',end='')
    else:
      print(S[i],end='')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
line_input = input()

lower_input = line_input.lower()
K -= 1
if K == 0:
	line_output = lower_input[K] + line_input[K+1:]
elif K == N-1:
    line_output = line_input[:K] + line_input[K]
else:
    line_output = line_input[:K] + lower_input[K] + line_input[K+1:]

print(line_output)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = str(input())
print(S.replace(S[K-1], S[K-1].lower(), 1))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=input()

if b>=2:
  print(c[b-2]+c[b-1].lower()+c[b:a])
else:
  print(c[0].lower()+c[1:a])

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = input()

if s[k-1] == "A":
    s = s.replace(s[k-1], "a")
elif s[k-1] == "B":
    s = s.replace(s[k-1], "b")
elif s[k-1] == "C":
    s = s.replace(s[k-1], "c")

print(s)

Submission status: Wrong Answer

Solution code:
N,K=(int(i) for i in input().split())
S=list(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)

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())

s = input()

for index, char in enumerate(s):
    if (index+1) == k:
        s = s.replace(char, char.lower())

print(s)

Submission status: Wrong Answer

Solution code:
N,K=map(int, input().split())
S=input()

S_small=S[K-1].lower()
S_ans=S.replace(S[K-1], S_small)
print(S_ans)

Submission status: Wrong Answer

Solution code:
N , K = map(int, input().split())
S     = input()

ls = []

for n in range(N):
	ls.append(S[n])

result = ""

for n in range(N):
	if n != K-1:
		result += ls[n]
	else:
		if S[K-1] == "A":
			result += "a"
		if S[K-1] == "B":
			result += "b"
		if S[K-1] == "C":
			result += "ac"

print(result)

Submission status: Wrong Answer

Solution code:
miu = input().split()
sella = input()

for x in sella:
	if x == int(miu[1]):
		print(x.lower(), end='')
	else:
		print(x, end='')

Submission status: Wrong Answer

Solution code:

N, K = input().split()

S = list(input())


K = int(K)

S[K-1] = str(S[K-1]).lower()

print(S)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = str(input())

s_list = list(S)
print(s_list)

tmp = s_list[K-1]
s_list[K-1] = tmp.lower()

''.join(s_list)

print(s_list)

Submission status: Wrong Answer

Solution code:
#A問題
N, K = map(int, input().split())
S = input()
if S[K-1] == "A":
    print(S.replace("A","a"))
elif S[K-1] == "B":
    print(S.replace("B","b"))
else:
    print(S.replace("C","c"))

Submission status: Wrong Answer

Solution code:
#
N, K= map(int, input().split())
S = input()
print(S.replace(S[K-1], S[K-1].lower(),1))

Submission status: Wrong Answer

Solution code:
n,k = input().split()
n = int(n)
k = int(k)
s = input()
lst = [i for i in s]
new = s.replace(lst[k-1], lst[k-1].lower())
print(new)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

s = S[K-1].lower()

print(S.replace(S[K-1], s))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()
S[K-1].lower()

print(S)

Submission status: Wrong Answer

Solution code:
ls = input().split()
s = list(input())
 
n = int(ls[0])
k = int(ls[1]) - 1
 
if s[k] == 'A':
  s[k] == 'a'
elif s[k] == 'B':
  s[k] == 'b'
elif s[k] == 'C':
  s[k] == 'c'
  
print(''.join(s))

Submission status: Wrong Answer

Solution code:

def main():
    N, K = map(int, [int(x) for x in input().split()])
    S = input()

    ans = ""
    for i, n in enumerate(S):
        if i == K-1:
            n = n.lower()
        ans += n

    return ans


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N ,K = map(int, input().split())
S = input()

K = K-1

s=list(S)

if s[K]=="A":
    s[K]='a'
elif s[K]=='B':
    s[K]='b'
elif s[K]=='C':
    s[K]='c'

print(s)

Submission status: Wrong Answer

Solution code:
x = input().split()
N = int(x[0])
K = int(x[1]) - 1
str_input = input()
str = list(str_input)

if str[K] == 'A':
    str[K] = 'a'
elif str[K] == 'B':
    str[K] = 'b'
elif str[K] == 'C':
    str[K] = 'c'


print(str)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
moji=input()

if moji[b-1]=="A":
  print(moji[:b-2]+"a"+moji[b:])
elif moji[b-1]=="B":
  print(moji[:b-2]+"b"+moji[b:])
else:
  print(moji[:b-2]+"c"+moji[b:])

Submission status: Wrong Answer

Solution code:
n,k=input().split()
s=[]
s=list(input())
k=int(k)

s[k-1]=s[k-1].lower()
print(s)
ans="".join(s)
print(ans)

Submission status: Wrong Answer

Solution code:
def main(n, k, s):
    l = list(s)
    print(l)
    l[k - 1] = l[k - 1].lower()
    print(''.join(l))
        
if __name__ == '__main__':
    try:
        n, k = list(map(int, input().strip().split(' ')))
        s = input().strip()
        main(n, k, s)
    except EOFError:
        pass

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
S = list(input())
print(S)
if S[K-1] == 'A':
  S[K-1] = 'a'
elif S[K-1] == 'B':
  S[K-1] = 'b'
else:
  S[K-1] = 'c'
print(''.join(S))

Submission status: Wrong Answer

Solution code:
N,K= list(map(int,input().split()))
S = input()
S = list(S)
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'
Snew = ''.join(S)
print(Snew)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

s=0
n,k = map(int,input().split())
s=list(input())

s[k-1].lower()

mojiretu = ''
 
for x in s:
    mojiretu += x
    
print(mojiretu)

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
S = list(input())

li = []

for i in range(N):
    if i != K-1:
        li.append(S[i])
    else:
        if S[i] =="A":
            li.append("a")
        if S[i] ==" B":
            li.append("b")
        if S[i] == "C":
            li.append("c")
print(''.join(li))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
n, k = map(int, input().split())
# 文字列の入力
s = input()
news = ""
for i in range(0, n):

    if i == k:
        news += s[i].lower()
    else:
        news += s[i]
print(news)

Submission status: Wrong Answer

Solution code:
n,k = map(int, input().split(" "))
s = input()
print(s[0:k-2]+s[k-1].lower()+s[k:-1])

Submission status: Wrong Answer

Solution code:
S = input()
A = S[:2]
A = int(A)
B = S[2:]
B = int(B)
if 0<A<13 and 0<B<13:
  print("AMBIGUOUS")
elif 0<A<13:
  print("MMYY")
elif 0<B<13:
  print("YYMM")
else:
  print("NA")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

s=0
n,k = map(int,input().split())
s=list(input())

s[k-1].lower()

mojiretu = ' '
 
for x in s:
    mojiretu += x
    
print(mojiretu)

Submission status: Wrong Answer

Solution code:
N ,K = map(int, input().split())
S = input()

K -= 1

s=list(S)
if s[K]=="A":
    s[K]='a'
elif s[K]=='B':
    s[K]='b'
elif s[K]=='C':
    s[K]='c'
print(s)

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
s = input()

if s[k-1] == "A" :
    s = s.replace(s[k-1],"a")
elif s[k-1] =="B":
    s = s.replace(s[k-1],"b")
else: s = s.replace(s[k-1],"c")

print(s)

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = list(input())

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

Submission status: Wrong Answer

Solution code:
n, k = (int(i) for i in input().split())
s = input()
ss = s.replace(s[k-1], s[k-1].lower())
print(ss)

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    # スペース区切りの整数の入力
    N, K = map(int, input().split())
    s = input()

    # s = aaa[0:N]
    s_list = list(s)
    s_list[1-K] = s_list[1-K].lower()

    ans_str = ""
    for a in s_list:
        ans_str += a

    print(ans_str)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

N, K = map(int, input().rstrip().split())
S = input().rstrip()

S = S.replace(S[K-1], S[K-1].lower(), 1)


print(S)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())

S=input()
K=K-1
s=S
s=str.lower(s)
S=S.replace(S[K],s[K])
ans=''
for _ in range (N):
    if _ ==K:
        ans+=s[_]
    else:
        ans+=S[_]

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n,k = li()
s = ns()

print(s[:k].lower() + s[k:])

Submission status: Wrong Answer

Solution code:
import sys

array = []
for line in sys.stdin.readlines():
    array.append(line.rstrip().split())
    
N = int(array[0][0])
K = int(array[0][1])
S = array[1][0]

print(S.replace(S[K-1], S[K-1].lower()))

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
S = str(input())
print(S[k-1].lower())

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = input()

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

Submission status: Wrong Answer

Solution code:
a = input().split()
b = input()
 
list = list(b)
 
for i in list:
  if i == int(a[1]) - 1:
    list[i] = list[i].lower()
    
print(''.join(list))

Submission status: Wrong Answer

Solution code:

# coding: utf-8

# In[ ]:

import sys
input = sys.stdin.readline
N, K = map(int, input().split())
S = input()


# In[5]:

ks = S[K].lower()
#ks = ks.lower()
#start_i = i-1 if i>0 else 0
S = S[:K] + ks + S[K+1:]
print(S)


# In[ ]:

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split())
S = input()
for s in range(len(S)):
    if s == K:
        print(S[s].lower(), end="")
    else:
        print(S[s], end="")

print("")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

N, K = map(int, input().rstrip().split())
S = input().rstrip()

S = S.replace(S[K-1], S[K-1].lower())


print(S)

Submission status: Wrong Answer

Solution code:
length, pos = input().split(' ')
length,pos = int(length), int(pos)
target = input()
if target[pos-1] == 'a':
  target[pos-1] = 'A'
if target[pos-1] == 'b':
  target[pos-1] = 'B'
if target[pos-1] == 'c':
  target[pos-1] = 'C'

print(target)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(' '))
c = input()
print(c.replace(c[b-1:b], c[b-1:b].lower()))

Submission status: Wrong Answer

Solution code:
#
N, K= map(int, input().split())
S = input()
print(S.replace(S[K-1], S[K-1].lower() ))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()
change = S[K-1]
change = change.lower()
S = S.replace(S[K-1],change)
print(S)

Submission status: Wrong Answer

Solution code:
#python 3.5.2

print ("Hello, world!")
N, K = [int(i) for i in input().split()]
S = input()
res = ""
for i,ch in enumerate(S):
    if i == K - 1:
        res += ch.lower()
    else:
        res += ch
print(res)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split(' '))
S = list(input().rstrip())

S[K-1] = S[K-1].lower()
print(S)

Submission status: Wrong Answer

Solution code:
def main():
    N, K = map(int, input().split())
    S = input()

    if S[K-1] == 'A':
        new_S = S.replace('A', 'a')
    elif S[K-1] == 'B':
        new_S = S.replace('B', 'b')
    elif S[K-1] == 'C':
        new_S = S.replace('C', 'c')

    print(new_S)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()

#S[N-1] = S[N-1].lower

print(S)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
c = list(input())
c[b-1] = c[b-1].lower()
print('{}'.format(str(c)))

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
s=input()
ls=[c for c in s]
for i in range(n):
    if i==k-1 and s[i]=='A':
        ls[i]='a'
    elif i==k-1 and s[i]=='B':
        ls[i]='b'
    elif i==k and s[i]=='C':
        ls[i]='c'
ss = ''.join(ls)
print(ss)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())

S=input()
K=K-1
s=S
s=str.lower(s)
S=S.replace(S[K],s[K])

print(S)

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
s=list(input())
ss=s[k-1]

ss=ss.lower()
#print(ss)
s[k-1] = ss
print(s)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = str(input())

if S[N-1]=="A":
    after="a"
elif S[N-1]=="B":
    after="b"
else:
    after="c"
str_changed = S[:K-1] + after + S[K:]
print(str_changed)

Submission status: Wrong Answer

Solution code:
chars = {'A': 'a', 'B': 'b', 'C': 'c'}
line = [int(x) for x in input().split(' ')]
s = input()
i = 1
for c in s:
    if i == line[1]:
        print(chars[c], end='')
    else:
        print(c, end='')
    i = 1 + 1
print()

Submission status: Wrong Answer

Solution code:
def character(n,k,s):
    res = str(s).replace(s[k-1],s[k-1].lower())
    return res
n,k = map(int, input().split())
s = input()
print(character(n,k,s))

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = list(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(''.join(s))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())

S = list(input())

a = str(S[K-1]).lower()

S[K-1] = a
print (S)
for i in range(N):
    print (S[i], end='')
print ()

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
S = list(input())

if S[K-1] == 'A':
    S[K-1] = 'a'
if S[K-1] == 'B':
    S[K-1] = 'b'
if S[K-1] == 'C':
    S[K-1] == 'c'

s = S[0]

for i in range(N-1):
    s += S[i+1]

print(s)

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())

string = input()

print(string.replace(string[k-1], string[k-1].lower()))

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
s=input()
ls=[c for c in s]
for i in range(n):
    if i==k and s[i]=='A':
        ls[i]='a'
    elif i==k and s[i]=='B':
        ls[i]='b'
    elif i==k and s[i]=='C':
        ls[i]='c'
ss = ''.join(ls)
print(ss)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

def main():
    n, k = [int(e) for e in input().split(" ")]
    print(n, k)
    s = ""
    for i, r in enumerate(input()):
        if i == k-1:
            s += r.lower()
        else:
            s += r
    print(s)

main()

Submission status: Wrong Answer

Solution code:
N,K=map(int, input().split())
S=input()
print(S.replace(S[K-1],chr(ord(S[K-1])+32),1))

Submission status: Wrong Answer

Solution code:
miu = input().split()[1]
sella = input()
 
sella[int(miu)-1].lower()
 
print(sella)

Submission status: Wrong Answer

Solution code:
import sys

a = []
for l in sys.stdin:
    a.append(l)

sent = a[1]
num = a[0].split()[1]
new_sent = [each_char for each_char in sent]
new_sent[int(num)] = new_sent[int(num)].lower()
new_sent = ''.join(new_sent)
print(new_sent)

Submission status: Wrong Answer

Solution code:
def main():
  inp = input()
  temp = inp.split()
  N = int(temp[0]); K = int(temp[1])
  S = input()[:-1]
  lower = S[K-1].lower()
  ans = S[:K-1] + lower + S[K:]
  print(ans)
  
if __name__ == "__main___":
  main()

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
S = input()
print(S.replace(S[K - 1], S[K - 1].lower()))

Submission status: Wrong Answer

Solution code:
N, K =map(int, input().split())
st = input()
print(st[:N-1] + st[N-1].lower()+st[N+1:])

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
s = list(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]='V'

print(''.join(s))

Submission status: Wrong Answer

Solution code:
N,K=map(int, input().split())
S=input()
print(S.replace(S[K-1],chr(ord(S[K-1])+32)))

Submission status: Time Limit Exceeded

Solution code:
N,K=map(int,input().split())
if N>K:
    ans=(N-K+1)/N
else:
    ans=0
for j in range(N):
    l=j
    m=0
    if j==0:
        pass
    while l<K:
        l=2*j
        m+=1
    else:
        ans+=(1/N)*1/(2**m)
print(ans)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
def replace(m):
  if m=="A":
    return "a"
  elif m=="B":
    return "b"
  else:
    return "c"
  
abc_str=list(input())
abc_str[k-1]=replace(abc_str[k-1])
abc_str="".join(abc_str)
print(abc_str)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print("".join(S))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = list(input())
S[K - 1] = S[K - 1].lower()
print(''.join(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = list(input())
s[k - 1] = chr(ord(s[k - 1]) + ord('a') - ord('A'))
print(''.join(s))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = list(input())

tmp = s.pop(k - 1)
l = tmp.lower()
s.insert(k - 1, l)
print(''.join(s))

Submission status: Accepted

Solution code:
n, k = map(int, input().split())

s = input()

L = []
for i in range(n):
    L.append(s[i])

L[k-1] = str.lower(L[k-1])
ans = str()
for i in range(n):
    ans += L[i]
print(ans)

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S=list(input())
S[K-1]=S[K-1].lower()
print("".join(S))

Submission status: Accepted

Solution code:
n,k=map(int,input().split(' '))
s=input()
m=''
if s[k-1].isupper():
    m=s[k-1].lower()
else:
    m=s[k-1].upper()

print(s[:k-1]+m+s[k:])

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = str(input())

ans = ''
ans += S[:K-1]
if S[K-1] == 'A':
  ans += 'a'
elif S[K-1] == 'B':
  ans += 'b'
else:
  ans += 'c'
ans += S[K:]
print(ans)

Submission status: Accepted

Solution code:
n,k=map(int, input().split())
s=input()
if s[k-1]=='A':
  s=s[:k-1]+'a'+s[k:]
if s[k-1]=='B':
  s=s[:k-1]+'b'+s[k:]
if s[k-1]=='C':
  s=s[:k-1]+'c'+s[k:]
print(s)

Submission status: Accepted

Solution code:
n, k = map(int,input().split())
s = input()
print(s[:k - 1], end = '')
print(str.swapcase(s[k - 1]), end = '')
print(s[k:])

Submission status: Accepted

Solution code:
n, k = map(int,input().split())
s = input()
result_s = ''
a = 0

for s in list(s):
    a += 1
    if a==k:
        s = s.lower()
    result_s += s

print(result_s)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = input()
ss = ''
for i in range(n):
    if i == k-1:
        ss += s[i].lower()
    else:
        ss += s[i]
print(ss)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = input()
print(s[:k-1]+s[k-1].lower()+s[k:])
print('\n')

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
moji = str(input())
ans = moji[:K-1] + moji[K-1].lower() + moji[K:]
print(ans)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = input()

print(s[:k-1]+s[k-1].lower()+s[k:])

Submission status: Accepted

Solution code:
s,k=map(int,input().split())
s = input()
print(s[:k-1]+s[k-1].lower()+s[k:])

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = input()
print(s[:k-1]+s[k-1].swapcase()+s[k:])

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = list(input())

s[k-1] = s[k-1].swapcase()
print("".join(s))

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = list(input())

if s[k - 1] == 'A':
    s[k - 1] = 'a'
if s[k - 1] == 'B':
    s[k - 1] = 'b'
if s[k - 1] == 'C':
    s[k - 1] = 'c'
strA = ''.join(s)
print(strA)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
S = str(input())
T = list(map(str,S))

for i in range(N):
    if i == K-1:
        T[i] = str.lower(T[i])

print("".join(T))

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
s=list(input())
s[k-1]=s[k-1].lower()
print("".join(s))

Submission status: Accepted

Solution code:
n,k = list(map(int,input().split()))
S = input()
print( S[:k-1]+S[k-1].lower()+ S[k:])

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
S = input()

# (K-1)文字目まで + K文字目 + K+1文字目から
print(S[:K-1] + S[K-1].lower() + S[K:])

Submission status: Accepted

Solution code:
import math


def main():
    # n = int(input())
    n, k = map(int, input().split())
    # h = list(map(int, input().split()))
    s = list(input())
    # h = [int(input()) for _ in rane(n)]

    s[k-1] = s[k-1].lower()
    print("".join(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
ans = ""
for i in range(len(S)):
    if i == K-1:
        ans +=  S[i].lower()
    else:
        ans += S[i]

print(ans)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
 
if S[K-1] == 'A': rep = 'a'
elif S[K-1] == 'B': rep = 'b'
else: rep = 'c'

# (K-1)文字目まで + K文字目 + K+1文字目から
print(S[:K-1] + rep + S[K:])

Submission status: Accepted

Solution code:
n,k = map(int,input().split())

s = list(input())
t = ''
for j,i in enumerate(s):
    if j == k-1:t += i.lower()
    else:t+=i
print(t)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print(''.join(s))

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = input()
sl = []
for i in range(n):
    if i+1 == k:
        sl.append(s[i].lower())
    else:
        sl.append(s[i])
print(''.join(sl))

Submission status: Accepted

Solution code:
n,k=map(int, input().split())
s=input()

s_list=list(s)

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

print("".join(s_list))

Submission status: Accepted

Solution code:
n ,k = map(int,input().split())
s = list(input())
s[k-1:k] = ''.join(s[k-1:k]).lower()
print(''.join(s))

Submission status: Accepted

Solution code:
Omoji = ['A','B','C']
Kmoji = ['a','b','c']
n,k = map(int,input().split())
s = str(input())
ans = ''
for i in range(n):
    if i==(k-1):
        for j in range(len(Omoji)):
            if s[i]==Omoji[j]:
                ans += Kmoji[j]
    else:
        ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()

list = [s for s in S]

list[K - 1] = list[K - 1].lower()

print(''.join(list))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
print("".join(c.lower() if i == K else c for i, c in enumerate(S, 1)))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
print(S[:K-1] + chr(ord(S[K-1]) - ord('A') + ord('a')) +S[K:])

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = list(input())
if S[K-1] == 'A':
  S[K-1] = 'a'
if S[K-1] == 'B':
  S[K-1] = 'b'
if S[K-1] == 'C':
  S[K-1] = 'c'
for i in S:
  print(i,end="")

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = input()
c = 'a' if s[k-1] == 'A' else 'b' if s[k-1] == 'B' else 'c'
print(s[:k-1] + c + s[k:])

Submission status: Accepted

Solution code:
n,k = [int(x) for x in input().split()]
s = input()
 
k -= 1
s = list(s)

if s[k] == "A":
  s[k] = "a"
elif s[k] == "B":
  s[k] = "b"
elif s[k] == "C":
  s[k] = "c"
 
print("".join(s))

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

N, K = rl()
S = rs()

ans = ''
for i, c in enumerate(S):
	if i == K-1:
		c = c.lower()
	ans += c
print(ans)

Submission status: Accepted

Solution code:
n,k = map(int, input().split())
s = input()

print(s[:k-1]+s[k-1].swapcase()+s[k:])

Submission status: Accepted

Solution code:
import sys 

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

input= sys.stdin.readline()
def convert(str,number):
  num = number-1
  str_one = str[num].lower()
  return str[0:num]+str_one+str[number:]
print(convert(input,num[1]))

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S=input()
print(S[0:K-1]+S[K-1].lower()+S[K:N])