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=input()
print(s[:k-1]+s[k-1].lower()+s[k:])

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=list(map(int,input().split()))
s=input()
s1=list(s)
s1[k-1]=s1[k-1].lower()
print("".join(s1))

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()

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())

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())
S = list(input())
S[K-1] = chr(ord(S[K-1])+32)
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=[i for i in 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"
for i in range(len(s)):
  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(int,input().split())
s=input()
l=[]
for i in range(len(s)):
    l.append(s[i])
b = l[k-1].lower()
l[k-1] = b
print(''.join(l))

Solution (Python):
n, k = map(int, input().split())
s = input()
v = s[k-1]
if k == 1:
    print(v.lower() + s[1:])
if k >= 2:
    print(s[:k-1] + v.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())


ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
abc = "abcdefghijklmnopqrstuvwxyz"

s = list(input())

s[k-1] = abc[ABC.find(s[k-1])]
  
print("".join(s))

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

s[k-1] = s[k-1].lower()
p = ""
for i in range(n):
  p += s[i]
print(p)

Solution (Python):
N,K=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"
else:
    S[K-1]="c"
print("".join(map(str,S)))

Solution (Python):
N,K = [int(x) for x in input().rstrip().split()]
S = input()
ans=""
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())
S1=list(input())

S1[K-1]=chr(int(ord(S1[K-1]))+32)

print(''.join(S1))

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())
S = list(input())

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

print(''.join(S))

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):

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

print(s)

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

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):
import sys
input = sys.stdin.readline

N, K = map(int, input().split())
S = list(input())
S.pop(-1)

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

Solution (Python):
a, b = map(int, input().split())
l = list(str(input()))

for i in range(a):
  if i == b-1:
    print(l[i].lower(), end="")
  else:
    print(l[i], end="")

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 = input().split()
S = input()
K = int(K)
li = list(S)
li[K-1] = chr(ord(S[K-1])+32)
print(''.join(li))

Solution (Python):
N, K = [int(i) for i in input().strip().split()]
S = input()
res = ""
for i in range(N):
    if i == K-1:
        res += S[i].lower()
    else:
        res += S[i]
print(res)

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

def komo(n):
  if n == "A":
    return "a"
  elif n == "B":
    return "b"
  else:
    return "c"
  
ans = S[:K-1] + komo(S[K-1]) + S[K:]

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 = S[K-1]
if s=='A':
    S[K-1] = 'a'
    print(''.join(S))
if s=='B':
    S[K-1] = 'b'
    print(''.join(S))
if s=='C':
    S[K-1] = 'c'
    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 = list(input())

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

Solution (Python):



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

if __name__=='__main__':
  main()

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

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

print(ans)

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

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

    S = list(input())
    S[K - 1] = chr(ord(S[K - 1]) + ord('a') - ord('A'))

    print("".join(S))


main()

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 = list(map(int,input().split()))
S = list(str(input()))
S[b-1] = str.lower(S[b-1])
S = "".join(map(str,S))
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,m = map(int, input().split())
s = list(input())

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

print(*s, sep='')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
N, K = MAP()
S = input()
 
if S[K - 1] == "A":
  S = S[0:K - 1] + "a" + S[K:]
if S[K - 1] == "B":
  S = S[0:K - 1] + "b" + S[K:]
if S[K - 1] == "C":
  S = S[0:K - 1] + "c" + S[K:]

print(S)

Solution (Python):
d={'A':'a','B':'b','C':'c'}
N,K=map(int,input().split())
S=input()
print(S[:K-1]+d[S[K-1]]+S[K:])

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

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

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

line = input()
S = list(i for i in line)
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=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):
N, K = map(int, input().split())
S = [s for s 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()
print("".join(s))

Solution (Python):
number = input().split(" ")
N = int(number[0])
K = int(number[1])
word = input()
words = []
for i in word:
	words.append(i)
if words[K-1] == "A":
	words[K-1] = "a"
elif words[K-1] == "B":
	words[K-1] = "b"
else:
	words[K-1] = "c"
for i in words:
	print(i,end="")

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

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

print()

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

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

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

Solution (Python):




from copy import deepcopy
N, K = map(int, input().split())
S = input()

l = [s for s in S]
l[K-1] = l[K-1].lower()
print(''.join(l))

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 = 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] = S[K-1].replace('A', 'a')
    print(''.join(S))
elif S[K-1] == 'B':
    S[K-1] = S[K-1].replace('B', 'b')
    print(''.join(S))
else:
    S[K-1] = S[K-1].replace('C', 'c')
    print(''.join(S))

Solution (Python):
import string

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

S[K-1]=chr(ord(S[K-1])+32)
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()

u = s.lower()

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

Solution (Python):
N, K = map(int, input().split())
s = list(input())
s[K-1] = chr(ord("a")+ord(s[K-1])-ord("A"))
print("".join(s))

Solution (Python):
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
n,k = i2()
s = l()
s[k-1] = s[k-1].lower()
for k in s:
    print(k,end="")

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

ans = ''
for i, s in enumerate(S):
  if i+1 == K:
    ans += str(S[i]).lower()
  else:
    ans += str(S[i])
print(ans)

Solution (Python):
n,k = list(map(int, input().split()))
s = input()
ls = list(s)
ans = []
for i in range(len(ls)):
    ls1 = ls[i]
    if i+1 == k:
        ls1 = ls1.lower()
    ans.append(ls1)
print("".join(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()

R = ""
count = 0
for s in S:
    if count != K-1:
        R += s
    else:
        R += s.lower()
    count += 1    
print(R)

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

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

print(ans)

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

Solution (Python):



n, k = [int(x) for x in input().split()]
s = input()
for i, l in enumerate(s):
    if i == k - 1:
        print(l.lower(), end='')
    else:
        print(l, end='')
print('')

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

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

Solution (Python):
n,k=map(int,input().split())
s=input()
j=0
ns=""
for i in s:
	if j==k-1:
		i=i.lower()
	j+=1
	ns+=i

print(ns)

Solution (Python):
N,K = map(int,input().split())
S=input()
K-=1
S_2=list(S)
S_2[K]=(chr(ord(S[K])+32))
S_3 =''.join(S_2)
print(S_3)

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())
moji = input()
moji = list(moji)
moji[k-1] = moji[k-1].lower()
ans = ''.join(moji)
print(ans)

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 = [int(i) for i in input().rstrip().split()]
S = input()
s = S[K-1]
s = s.lower()
S = S[:K-1] + s + S[K:]
print(S)

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

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

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

ans = ''
i = 1
for abc in s:
  if i == k:
    ans += abc.lower()
  else:
    ans += abc
  i += 1

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[:K-1]+S[K-1].lower()+S[K:])

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

Solution (Python):


def pin(type=int):
    return map(type,input().split())



def comp(p):
    return ((p+1)/2)

        

N,k=pin()
S=input()
ans=""
for i in range(N):
    ans+=S[i] if i!=k-1 else chr(ord(S[i])+32)
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 = 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):
import sys
from string import ascii_lowercase, ascii_uppercase

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    N, K = MAP()
    S = INPUT()

    ans = ""
    for i in range(N):
        if i == K - 1:
            for j, a in enumerate(ascii_uppercase):
                if S[i] == a: ans += ascii_lowercase[j]
        else: ans += S[i]

    print(ans)


if __name__ == '__main__':
    main()

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

Solution (Python):
n, k = map(int, input().split())
r = list(input())
r[k-1] = r[k-1].lower()
print(*r, 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 = input()
for i, s in enumerate(S):
    if i == K - 1 :
        print(s.lower(), end="")
    else :
        print(s, end="")

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

for i in range(n):
    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):
NK = input()
S = input()

N = int(NK.split()[0])
K = int(NK.split()[1])

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

i = K-1
print(S[:i]+low+S[i+1:])

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 = [int(x) for x in 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()
    print(*S, sep='')


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'
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):
Input_num = input().split()
Input_cou = input()

num = int(Input_num[1])

print(Input_cou[:num-1] + Input_cou[num-1].lower() + Input_cou[num:])

Solution (Python):
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()

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

print(s)

Solution (Python):
import re
pat = r'[0-9]+'

Input_num = input()
Input_cou = input()

num_list = re.findall(pat, Input_num)
num = int(num_list[1])

print(Input_cou[:num-1] + Input_cou[num-1].lower() + Input_cou[num:])

Solution (Python):
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)

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

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

print(S[:K-1]+chr(ord(S[K-1])+32)+S[K:])

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

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

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

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

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

for i in range(N):
  if i == K - 1:
    S[i] = chr(ord(S[i]) + 0x20)
    break
    
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()

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

Solution (Python):
N, K = list(map(int, input().split()))
S = str(input())
m = chr(ord(S[K-1]) + 32)
print(S[:K-1] + m + S[K:])

Solution (Python):
n,k=[int(i) for i in 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())
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 = list(map(str, input()))

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

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

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

print("".join(s))

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

Solution (Python):
N,K =map(int,input().split())
S=str(input())
h=S[K-1]
h=str.swapcase(h)
S=S[:K-1]+h+S[K:]
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] + chr(ord(s[k - 1]) - ord('A') + ord('a')) + 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):
a,b=map(int,input().split())
c=list(input())
if c[b-1]=='A':
  c[b-1]='a'
elif c[b-1]=='B':
  c[b-1]='b'
else:
  c[b-1]='c'
d=''
for i in range(a):
  d+=c[i]
print(d)

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()
for i, c in enumerate(s):
    if i+1==k:
        print(c.lower(), end="")
    else:
        print(c, end="")
print("")

Solution (Python):
def resolve():
    import sys
    input = sys.stdin.readline
    
    N, K = map(int, input().split())
    S = input()
    res = S[:K-1] + S[K-1].lower() + S[K:]
    print(res)


if __name__ == "__main__":
    resolve()

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int, K: int, S: str):
    s = list(S)
    s[K-1] = s[K-1].lower()
    print(''.join(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 = [i for i in 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=input()
st=""
for i in range(N):
    if i==K-1:
        st="".join((st,chr(ord(S[i])+32)))
    else:
        st="".join((st,S[i]))


print(st)

Solution (Python):
N, K = map(int, input().split())
S = input()
Slist = [char for char in S]

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

for str in Slist:
  print(str, end='')

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

for i in range(0,len(s)):
	
	if i == k - 1:
		ans.append(s[i].lower())
	else:
		ans.append(s[i])

print("".join(ans))

Solution (Python):
N,K = map(int, input().split())
S = str(input())
S1 = list(S)
S1[K-1] = S1[K-1].lower()
for i in range(N):
    print(*S1[i],end="")

Solution (Python):
N = input().split()                                                             
N = [int(n) for n in N]                                                         
S = input()                                                                     
s = S.swapcase()                                                                
ans = str(S[0:N[1]-1] + s[N[1]-1] + S[N[1]:])                                   
print(ans)

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

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

Solution (Python):
import sys

n, k = map(int, sys.stdin.readline().split())
s = sys.stdin.readline().rstrip()

def main():
    return s[:k-1] + s[k-1].lower() + s[k:]

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

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

S[K - 1] = chr(ord(S[K - 1]) + 32)

print("".join(S))

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

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

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(i) for i in 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())
a=["a","b","c"]
A=["A","B","C"]
T=str()
for i in range(N):
    if i==K-1:
        T=T+a[A.index(S[i])]
    else:
        T=T+S[i]
print(T)

Solution (Python):
n, k = list(map(int, input().split()))
print(''.join(v.lower() if i + 1 == k else v for i, v in enumerate(input())))

Solution (Python):
import sys

stdin = sys.stdin

mod = 1000000007
inf = 1 << 60

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

n, k = na()
s = ns()
t = [s[i] for i in range(n)]
t[k - 1] = t[k - 1].lower()

for i in range(n):
	print(t[i], end='')
print()

Solution (Python):
from sys import stdin
N, K = [int(i) for i in stdin.readline().rstrip().split()]
S = stdin.readline().rstrip()
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"
print("".join(S))

Solution (Python):


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

S[K-1]=chr(ord(S[K-1])+32)

print("".join(S))

Solution (Python):
import sys
import math

num = list(map(int,input().split()))
N=num[0]
k=num[1]
s=input()

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

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

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

Solution (Python):
import os, sys, re, math

(N, K) = [int(n) for n in 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):
_, b = list(map(int, input().split(' ')))
s = input()
new_s = ''
for i in range(len(s)):
    new_s += s[i] if i+1 != b else s[i].lower()
print(new_s)

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

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):
def main():
    N,K = map(int, input().split())
    S = input()
    out_str = ""
    for i in range(N):
        if i==K-1:
            out_str+=S[i].lower()
        else:
            out_str+=S[i]
    print(out_str)
main()

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

for i in range(len(S)):
    if i+1 == K:
        ans += str.lower(S[i])
    else:
        ans += S[i]

print(ans)

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

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

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

Solution (Python):
a, b = (int(x) for x in input().split())
word = list(input())
new_word = ""
word[b-1] = word[b-1].lower()
for i in word:
    new_word += i
print(new_word)

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:].capitalize().swapcase())

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

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

print(''.join(map(str, ans)))

Solution (Python):















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

if K==1 :
    str1 = ''
else :
    str1 = S[0:K-1]

if K==N:
    str3 = ''
else :
    str3 = S[K:N]

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

print(str1+str2+str3)

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

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

print(s[:k-1] + s.lower()[k-1] + 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()

print("{}{}{}".format(s[:k-1],s[k-1].lower(),s[k:]))

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

Solution (Python):
import math
import sys
import numpy as np

def int_input():
    return map(int, input().split())

n, k = int_input()
s = list(input())
s[k - 1] = chr(ord(s[k - 1]) + 32)
for i in range(n):
    print(s[i], end = "")

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())
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]=chr(ord(s[k-1])+32)
 
print(*s,sep='')

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

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=S.pop(k-1)

s=s.lower()

S.insert(k-1, s)

print(''.join(S))