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

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

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

Solution (Python):
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"
print("".join(s))

Solution (Python):
a,b=map(int, input().split())
c=list(input())
k=b-1
l=[]
for i in range(a):
	if i==k:
		print((c[i].lower()), end='')
	else:
		print((c[i]), end='')

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

for i in range(n):
    if (k-1 == i):
        print(s[i].lower(), end="")
    else:
        print(s[i], end="")
print("")

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

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

for i in range (N):
  if i == K-1:
    print(S[i].lower(),end="")
  else:
    print(S[i],end="")

Solution (Python):
n,k = map(int,input().split())
s = list(input())
for i in range(n):
    if i == k-1:
        print(s[i].lower(),end="")
    else:
        print(s[i],end="")

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

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

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

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

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

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

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

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

Solution (Python):
from itertools import accumulate
import sys
from heapq import heappush, heappop

def main():
    input = sys.stdin.readline
    N, K = map(int, input().split())
    S = list(input())
    S[K-1] = S[K-1].lower()
    print("".join(S))

if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
b=b-1
s=input()
l=len(s)
s2=[]
for i in range(l):
    if(i == b):
        s2.append(s[b].lower())
    else:
        s2.append(s[i])
for j in range(l):
    print(s2[j], end ='')
print()

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

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

Solution (Python):
n,k = map(int,input().split())
s = input()
S = []
for i in range(n):
  S.append(s[i])
S[k-1] = S[k-1].lower()
print(*S,sep='')

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

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

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

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

S_list = [c for c in S]


if S_list[K-1] == 'A':
  S_list[K-1] = 'a'
elif S_list[K-1] == 'B':
  S_list[K-1] = 'b'
else:
  S_list[K-1] = 'c'

print(''.join(S_list))

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

s = S[K-1]

if s == 'A':
    S = S[:K-1] + 'a' + S[K:]
elif s == 'B':
    S = S[:K-1] + 'b' + S[K:]
else:
    S = S[:K-1] + 'c' + S[K:]

print(S)

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

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

for i in range(n):
    if i == k - 1:
        ans = s[i].lower()
    else:
        ans = s[i]
    print(ans, end='')

Solution (Python):
s=list(input().split())
n=int(s[0])
k=int(s[1])
t=list(input())

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

tlast=''.join(t)
print(tlast)

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

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

Solution (Python):
n,k = [int(i) for i in input().split()]
string = input()

l = []
for idx,i in enumerate(string):
    if idx == k -1:
        l.append(i.lower())
    else:
        l.append(i)

print(''.join(l))

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

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

Solution (Python):

import sys


def solve(N: int, K: int, S: str):
    print(S[:K - 1] + S[K - 1].lower() + S[K:])
    return




def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    S = next(tokens)  
    solve(N, K, S)


if __name__ == '__main__':
    main()

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

ans = ""
for i, j in enumerate(list(s)): 
  if i == k - 1:
    ans += j.lower()
  else:
    ans += j

print(ans)

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

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

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

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

print("".join(s))

Solution (Python):
if __name__ == '__main__':
    N, K = map(int, input().split())
    S = list(str(input()))
    s = S[K-1]
    S[K-1] = s.lower()
    print(''.join(S))

Solution (Python):
while True:
    try:
        N, K = map(int, input().split())
        S = list(input())
        S[K-1] = S[K-1].lower()
        print(''.join(S))
    except:
        break

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

Solution (Python):
n,k=map(int,input().split())
S=list(input())

S[k-1]=S[k-1].lower()
print(*S,sep='')

Solution (Python):
def main():
    n, k = map(int, input().split())
    s = list(input())

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

def main():
    n, k = map(int, input().split())
    s = input()

    for i in range(n):
        if i == k - 1:
            print(s[i].lower(), end="")
        else:
            print(s[i], end="")

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):

import sys


def solve(N: int, K: int, S: str):
    Slist = list(S)
    Slist[K-1] = Slist[K-1].lower()
    
    S = ''.join(Slist)
    print(S)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    S = next(tokens)  
    solve(N, K, S)

if __name__ == '__main__':
    main()

Solution (Python):
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"
for i in range(n):
    print(s[i],end= "")

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

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

ans = ""
for i, j in enumerate(list(s)): 
  if i == k - 1:
    ans += j.lower()
  else:
    ans += j

print(ans)

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

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

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

Solution (Python):
n, k = map(int, input().split())
s = input()
answer = []

for i, c in enumerate(s, 1):
    if i == k:
        answer.append(c.lower())
    else:
        answer.append(c)
print("".join(answer))

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

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

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

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

Solution (Python):
def main():
    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)


main()

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

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

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

output =""
for i,char in enumerate(S):
    if i+1==K:
        output+=char.lower()
    else:
        output+=char
print(output)

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

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

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

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

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

Solution (Python):
n,k = map(int, input().split())
s = [x for x in input()]
s[k-1] = s[k-1].lower()
print(''.join(s))

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

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

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

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

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

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

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

if K == 1:
    print(lower_str + S[K:])
elif 1 < K < N-1:
    print(S[:K-1] + lower_str + S[K:])
elif (K > 1) and (K == N-1):
    print(S[:K-1] + lower_str + S[K])
elif K == N:
    print(S[:K-1] + lower_str)

Solution (Python):
def komoji(s):
    if s =="A":
        return "a"
    elif s == "B":
        return "b"
    else: return "c"

N, K =map(int,input().split())
S = input()
print(S[:K-1]+komoji(S[K-1])+S[K:])

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

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

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

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

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

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

Solution (Python):
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"

print(''.join(str(ans) for ans in s))

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

Solution (Python):
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"
 
print("".join(s))

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

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

Solution (Python):
n,k = [int(i) for i in input().split()]
word = input()
print(word[:k-1]+word[k-1].lower()+word[k:])

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

S[K - 1] = S[K - 1].lower()
S = "".join(S)

print (S)

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

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

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

Solution (Python):
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'
  
print(''.join(S))

Solution (Python):
_, K = map(int, input().split())
S = input()

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

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

Solution (Python):
def func():
    N, K = map(int, input().split())
    S = input()

    ans = ""
    for i in range(N):
        if i == K - 1:
            ans += S[i].lower()
        else:
            ans += S[i]
    print(ans)


if __name__ == '__main__':
    func()

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

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

Solution (Python):
N,K = map(int,input().split())
S = input()
answer = ''
for i in range(len(S)):
    if i == K - 1:
        answer += S[i].lower()
    else:
        answer += S[i]
print(answer)

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

Solution (Python):
N=list(map(int,input().split()))
S=list(input())
k=N[1]
S[k-1]=S[k-1].lower()
j = ' '
 
for x in S:
    j += x
print(j)

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

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

print("".join(s_lis))

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

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

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

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

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

S_list = list(S)

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

print("".join(S_list))

Solution (Python):
a,b=map(int,input().split())
s=input()
 

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

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

Solution (Python):
N,K=map(int, input().split())
S=input()
if K==1:
  S=S[K-1].lower()+S[K:]
elif K==N:
  S=S[:K-1]+S[K-1].lower()
else:
  S=S[:K-1]+S[K-1].lower()+S[K:]
print(S)

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

Solution (Python):

N,K = list(map(int,input().split()))
S = input()
if K == 1:
    print(S[0:1].lower() + S[K:])
elif K == N:
    print(S[:K-1] + S[K-1:K].lower())
else:
    print(S[:K-1] + S[K-1:K].lower() + S[K:])

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

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

if k == 1:
    print(x+s[k:n])
else:
    print(s[:k-1]+x+s[k:n])

Solution (Python):
import sys
input=sys.stdin.readline

def main():
    _, K = map(int, input().split())
    S = input().strip()
    print(S[:K-1] + S[K-1].lower() + S[K:])

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
input = sys.stdin.readline
n,k = map(int,input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print("".join(s))

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

LS = list(S)
LS[K - 1] = LS[K - 1].lower()
print("".join(LS))

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

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

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

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

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

Solution (Python):
A = list(map(int,input().split()))
S=[i for i in input()]    
S[A[1]-1] = S[A[1]-1].lower()
print(*S,sep='')

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

Solution (Python):
n, k = map(int, input().split())
word = input()
res = ''
for index, w in enumerate(word):
	if index == k-1:
		w = w.lower()
	res += w
print(res)

Solution (Python):
n, k = map(int, input().split())
s = input()
ans = ""

for i in range(n):
    ans += s[i].lower() if i == k - 1 else s[i]

print(ans)

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

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

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

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


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

print(''.join(S))

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


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

print(''.join(S[:K - 1] + [s] + S[K:]))

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

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

Solution (Python):
n,k=map(int,input().split())
ans = ''
cnt = 0
for a in input():
  cnt += 1
  if cnt == k:
    ans += a.lower()
  else:
    ans += a
print(ans)

Solution (Python):
N, K = list(map(int, input().split()))
S = input()
if K == 1:
    print(S[0:1].lower() + S[1:])
elif K == N:
    print(S[0:K - 1] + S[-1].lower())
else:
    print(S[0:K - 1] + S[K - 1:K].lower() + S[K:])

Solution (Python):
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))

Solution (Python):
N,K = map(int, input().split())
S = input()
S = [c for c in S]
S[K-1] = S[K-1].lower()
res = print(''.join(S))

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

Solution (Python):
N, K = map(int, input().split())
S = input()
A = ""

for i in range(N):
    if i == K-1:
        if S[K-1] == "A":
            A += "a"
        elif S[K-1] == "B":
            A += "b"
        else:
            A += "c"
    else:
        A += S[i]
    
print(A)

Solution (Python):
import sys
input = sys.stdin.readline

import heapq

def main(): 

    N,K = map(int,input().split())
    S=list(input().split())
    S=list(S[0])
    S[K-1]=S[K-1].swapcase()
    print("".join(S))

if __name__ == "__main__":
    main()

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

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

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

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

print(''.join(S))

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

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

letters = ''
for i, l in enumerate(input()):
  if i + 1 == k:
    letters += l.lower()
  else:
    letters += l
print(letters)

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

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

Solution (Python):
n,k=map(int,input().split())
S=input()
s_dict={
   'A':'a', 
   'B':'b',
   'C':'c'
   }
ans=''

for i,s in enumerate(S):
    if i!=(k-1):
        ans+=s
    else:
        ans+=s_dict[s]
print(ans)

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

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

Solution (Python):
a,b=map(int,input().split())
c=list(input())
c[b-1]=c[b-1].lower()
print(*c,sep="")

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

Solution (Python):
n,k=map(int,input().split())
b=list(input())
b[k-1]=b[k-1].lower()
print(*b,sep="")

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

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

print(''.join(S))

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

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

Solution (Python):
n, k = map(int, input().split())
s = str(input()).upper()
if 1 <= n <= 50 and 1 <= k <= n == len(s):
    chibi = s[k-1].lower()
    moji = list(s)
    moji[k-1] = chibi
    print("".join(moji))
else:
    print('Invalid value')

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

    ans = ""
    for i in range(N):
        if i == K-1:
            ans += S[i].lower()
        else:
            ans += S[i]
    return ans
    
if __name__ == '__main__':
    print(main())

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

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

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

Solution (Python):
N,K=map(int,input().split())
S=str(input())
s=S[K-1:K]
s1=S[0:K-1]
s2=S[K:N]
if s=='A':
    ans=s1+'a'+s2
elif s=='B':
    ans=s1+'b'+s2
else:
    ans=s1+'c'+s2
print(ans)

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

S = input()

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

Solution (Python):

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

Solution (Python):
n, k = [int(el) for el in input().split(' ')]
s = input()
print(s[:k-1] + s[k-1].lower() + s[k:])

Solution (Python):
x = [int(i) for i in input().split()]
str = input()
str_list = list(str)
for i in range(x[0]):
    if(i==x[1]-1):
        str_list[i] = str_list[i].lower()
    print(str_list[i], end="")

Solution (Python):
N,K = map(int,input().split())
S = [s for s in input()]
ans = ""

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

for s in S:
    ans += s 
print(ans)

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

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

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

Solution (Python):


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

    return S[:K-1] + S[K-1].lower() + S[K:]

if __name__ == '__main__':
    print(main())

Solution (Python):
n, k = map(int, input().split())
string = input()
ans = ''
for i, char in enumerate(string):
    if i == (k - 1):
        ans += char.lower()
    else:
        ans += char
print(ans)

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

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

print("".join(s))

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

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

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

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

Solution (Python):

N, K = map(int, input().split())
S = list(input())
S[K - 1] = S[K - 1].lower()
ans = ''

for st in S:
	ans += st

print(ans)

Solution (Python):

import sys
import math
from collections import defaultdict


sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]


mod = 10**9 + 7


def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))



N,K = II()
S = str(input())

S = S[:K-1] + S[K-1].lower() + S[K:]

print(S)

Solution (Python):
n,k=[int(i) for i in input().split()]
word=input()
if word[k-1]=="A":
    print(word[:k-1]+"a"+word[k:])
if word[k-1]=="B":
    print(word[:k-1]+"b"+word[k:])
if word[k-1]=="C":
    print(word[:k-1]+"c"+word[k:])

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

Solution (Python):
n, k = map(int, input().split())
s = input()
S = []
for i in range(n):
    if i == k-1:
        S.append(s[i].lower())
    else:
        S.append(s[i]) 

s = "".join(S)
print(s)

Solution (Python):



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








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

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


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

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

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

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

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

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

Solution (Python):
n, k = map(int, input().split())
s = input()
print("".join([s[i].lower() if i == k-1 else s[i] for i in range(n)]))

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

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

for num, i in enumerate(s):
    if num == k-1:
        print(i.lower(), end='')
    else:
        print(i, end='')
print()

Solution (Python):
N,K=input().split()
N,K=int(N),int(K)-1
S=input()


'''
if S[K]=="A":
    S[K]="a"
elif S[K]=="B":
    S[K]="b"
else:
    S[K]="c"

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

print("".join(Slist))

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

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

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

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

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

Solution (Python):
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))

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

print(m)

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

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

ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

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

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

for i in S:
    ANS+=i

print(ANS)

Solution (Python):
def solve():
    n, k = map(int, input().split())
    s = input()
    ans = ""
    for i in range(n):
        if k == i + 1:
            ans += s[i].lower()
        else:
            ans += s[i]
    return ans


if __name__ == "__main__":
    print(solve())

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

Solution (Python):
_, K = map(int, input().split())
S=input()
print(S[0:K-1],S[K-1].lower(),S[K:], sep="")

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

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

Solution (Python):

inputa = input().split()

inputb = input()


a = int(inputa[0])
b = int(inputa[1])


inputList = list(inputb)

inputList[b-1] = inputList[b-1].lower()

ans = "".join(inputList)

print(ans)

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

if s[k-1] == 'A':
    s = s[:k-1]+'a'+s[k:]
elif s[k-1] == 'B':
    s = s[:k-1]+'b'+s[k:]
else:
    s = s[:k-1]+'c'+s[k:]

print(s)

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

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

for i in s:
    print(i,end="")

print("")

Solution (Python):
temp=list(map(int, input().split()))
S=list(input())
K=int(temp[1]-1)

if S[K]=='A':
  S[K]='a'
elif S[K]=='B':
  S[K]='b'
else:
  S[K]='c'
  
print("".join(S))

Solution (Python):

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

S2 = ''

for i in range(len(S)):
    if i == K-1:
        S2 = S2 + S[K-1].replace('A', 'a').replace('B', 'b').replace('C', 'c')
    else:
        S2 = S2 + S[i]

print(S2)

Solution (Python):
n,k=map(int,input().split())
l=[i for i in str(input())]

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

print(''.join(l))

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

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

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

Solution (Python):
N,K=(int(x) for x in input().split())
S=input()
Sa=S[:K-1]+str(S[K-1].lower())+S[K:]
print(Sa)