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())
ans = S
ans[K-1] = ans[K-1].lower()
print(''.join(ans))

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

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

S = list(S)
S[index] = s_char
print("".join(S))

Solution (Python):
input1 = list(map(int, input().split()))

tar_str = input()

output_str = ''

for i in range(len(tar_str)):
    if i == input1[1] - 1:
        output_str += tar_str[i].lower()
    else:
        output_str += tar_str[i]

print(output_str)

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

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

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 = 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 range(N):
    print(S[i], end="")
print()

Solution (Python):
import sys

stdin = sys.stdin

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

n,k = na()
s=ns()
print(s[:k-1]+s[k-1].lower()+s[k:])

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

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

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

print(ans)

Solution (Python):

import sys


def solve(N: int, K: int, S: str):
    S = S[:K-1] + S[K-1].lower() + S[K:]
    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 = input()

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

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

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

Solution (Python):
import numpy as np

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

if moji[K-1]=="A":
    moji[K-1]="a"
if moji[K-1]=="B":
    moji[K-1]="b"
if moji[K-1]=="C":
    moji[K-1]="c"
    
exportmoji=""
for x in moji:
    exportmoji+=x
print(exportmoji)

Solution (Python):
from sys import stdin
import numpy as np










N, K = [int(x) for x in stdin.readline().rstrip().split()]
S = list(stdin.readline().rstrip().split()[0])

ABC = list("ABC")
abc = list("abc")
idx = ABC.index(S[K-1])
S[K-1] = abc[idx]
print("".join(S))

Solution (Python):
if __name__ == '__main__':
    args = input().split(' ')
    s = input()
    k = int(args[1])
    n = int(args[0])
    if k == 1:
        print(s[k - 1].lower() + s[k:])
    elif k == n:
        print(s[0:k-1] + s[k - 1].lower())
    else:
        print(s[0:k-1] + s[k - 1].lower() + s[k:])

Solution (Python):
import sys
import math 
import numpy as np
ni = lambda: int(ns())
na = lambda: list(map(int, input().split()))
ns = lambda: input()

N,K=na()
S=ns()
s=S[K-1]


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

print(ans)

Solution (Python):
N,K = map(int,input().split())
S = input()
a = []
for i in range(N):
  a.append(S[i])
a[K-1] = a[K-1].lower()
b = ''.join(a)
print(b)

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

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 = map(int, input().split())
S = input()


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

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()
a = []
for i in range(N):
  a.append(S[i])
a[K-1] = a[K-1].lower()
b = ''.join(a)
print(b)

Solution (Python):


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

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

print("".join(s))

Solution (Python):
def inpl():
    return list(map(int, input().split()))


N, K = inpl()
S = list(input())
S[K - 1] = S[K - 1].lower()
print("".join(S))

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



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

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


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
n,k = map(int,input().split())
s = input()
komoji = str.lower(s[k-1])
if k-1 != 0 and k-1 != n-1:
    sum = s[0:k-1] +komoji+s[k:]
elif k-1 == 0:
    sum = komoji + s[k:]
else:
    sum = s[0:k-1] + komoji
print(sum)

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

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

Solution (Python):
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while a % b > 0: a, b = b, a % b
    return b
  
def solve():
    N, K = map(int, line_input())
    S = single_input()
    print(S[:K-1] + S[K-1].lower() + S[K:])
    return 0
  
if __name__ == "__main__":
    solve()

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()
s_list=list(s)
character=s_list[k-1]
s_list[k-1]=character.lower()
print("".join(s_list))

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

Solution (Python):
import sys

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

abcs = input()
 
def change_upper_to_lower(str, num):
  
  before = str[:int(num) - 1]
  after = str[int(num):]

  if(str[int(num) - 1] == "A"):
    newstr = before + "a" + after
  elif(str[int(num) - 1] == "B"):
    newstr = before + "b" + after
  else:
    newstr = before + "c" + after
    
  return newstr
 
 
changed_abcs = change_upper_to_lower(abcs, b)
 
print(changed_abcs)

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'
elif S[k-1]=='C':
    S[k-1]='c'


h=''
for i in S:
    h+=i

print(h)

Solution (Python):

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

s = input()

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

b = s[:k-1]

a = s[k:]

new_s = b + word + a

print(new_s)

Solution (Python):
n,k=map(int,input().split())
s=input()
ans=''
for i in range(len(s)):
  if i==k-1:
    if s[i]=='A':
      ans+='a'
    elif s[i]=='B':
      ans+='b'
    else:
      ans+='c'
  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):
H, K = map(int, input().split())
S = list(input())

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

join = ''.join(S)

print(join)

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

Solution (Python):


n=list(map(int,input().split()))
K = n[1]


string =input()
s = [i for i in string]
s[K-1] = s[K-1].lower()

print("".join(s))

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

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

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

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

Solution (Python):
import functools
def a(c0, c1):
   return c0+c1

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

s[k-1] = s[k-1].lower()
d = functools.reduce(a, s)

print(d)

Solution (Python):
i = list(map(int,(input().split())))
word = list(input())

count = 0
ans = []
for n,moji in enumerate(word):
  if n == (i[1]-1):
    ans.append(moji.lower())
  else:
    ans.append(moji)
    
print(('').join(ans))

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

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

s = list(s)
lower_case = chr(ord(s[k-1]) + 0x20)

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

Solution (Python):
N,K = [int(x) for x in input().split()]
S = str(input())
replace = list(S)

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

answer = ''.join(replace)

print(answer)

Solution (Python):
NK = input().split()
NK = [int(s) for s in NK]

S = input()

out = ''
if NK[1] == 1:
    out = S.capitalize().swapcase()
else:
    out = S[:NK[1] - 1] + S[NK[1]-1:].capitalize().swapcase()

print(out)

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

s = (input())

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

print(o)

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

A=[]
for i in n:
  A.append(i)
if A[c-1]=='A':
  A[c-1]='a'
if A[c-1]=='B':
  A[c-1]='b'
if A[c-1]=='C':
  A[c-1]='c'
ji=''.join(A)
print(ji)

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



d=a-b+1
c = list(c)
d = c[b-1]
c[b-1] = d.lower()

c = "".join(c)
print(c)

Solution (Python):
import bisect
import math
def solve():
  query = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  tp ='abcdefghijklmnopqrstuvwxyz'
  n,k = (int(i) for i in input().split())
  s = input()
  a = ""
  for i in range(n):
    if i != (k-1):
     a += s[i]
    else:
     tmpo = query.find(s[i])
     a += tp[tmpo]
  print(a)
solve()

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

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

ans = ""

if slis[k-1] == "A":
    slis[k-1] = "a"
elif slis[k-1] == "B":
    slis[k-1] = "b"
elif slis[k-1] == "C":
    slis[k-1] = "c"

for i in range(n):
    ans += slis[i]

print(ans)

Solution (Python):
n,k=list(map(int,input().split()))
s=input()
if s[k-1]=="A":
    i="a"
if s[k-1]=="B":
    i="b"
if s[k-1]=="C":
    i="c"
if k!=n:
    for j in range(n):
        if j==k-1:
            print(i,end="")
        elif j==n-1:
            print(s[j])
        else:
            print(s[j],end="")
if k==n:
    for j in range(n):
        if j==n-1:
            print(i)
        else:
            print(s[j],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=map(int,input().split())
S=input()
S_line=[i for i in S]
S_line[K-1]=S_line[K-1].lower()
ans=''
for i in S_line:
  ans+=i
print(ans)

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

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

ans = ''
for i, c in enumerate(s):
    if i == k -1:
        ans += str.lower(c)
    else:
        ans += c
    
print(ans)

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

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

Solution (Python):


n, k = map(int, input().split())
s = input()
word2 = []
for i, word in enumerate(s):
        if i == k-1:
                word2.append(word.lower())
        else:
                word2.append(word)
print(''.join(word2))

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

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

print("".join(s))

Solution (Python):


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

s = input()

a = []
for i in s:
    a.append(i)

if a[k-1] =="A":
    a[k-1] = "a"

elif a[k-1] =="B":
    a[k-1] = "b"

elif a[k-1] =="C":
    a[k-1] = "c"

for i in range(len(a)):
    print(a[i], end = "")

Solution (Python):
N,X=map(int,input().split())
S=list(input())
W=""
if S[X-1]=="A":
  S[X-1]="a"
if S[X-1]=="B":
  S[X-1]="b"
if S[X-1]=="C":
  S[X-1]="c"
for i in S:
  W=W+i
print(W)

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

Solution (Python):

import numpy as np
import types


l = list(map(int, input().split()))
_ = l[0]
K = l[1] - 1 


S = list(input())


if K == 0:
    left = list("")
else:
    left = S[:K]

if K == len(S)-1:
    right = list("")
else:
    right = S[K+1:]

output = left + list(str(S[K]).lower()) + right
print( ''.join(output) )

Solution (Python):
ls = [list(input().split()) for i in range(2)]

N = int(ls[0][0])

K = int(ls[0][1])

S = ls[1][0]


S0 = S[:K-1]

S1 = S[K-1:K]

S2 = S[K:]


if S1 == 'A' :
    S_New = 'a'
elif S1 == 'B' :
    S_New = 'b'
elif S1 == 'C' :
    S_New = 'c'
print(S0 + S_New + S2)

Solution (Python):
N,K=(int(i) for i in 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'

A=''.join(S)
print(A)

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

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

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

print(x)

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'
    
S0 = ''
for x in S:
    S0 += x
    
print(S0)

Solution (Python):
N,K = (int(i) for i in input().split())
string = input()
S = list(string)

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"

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

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()
S_new = []
for i in range(N):
  if i == K-1:
    S_new.append(S[i].lower())
  else:
    S_new.append(S[i])

SA = ''.join(S_new)
print(SA)

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

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

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

Solution (Python):



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


out = ""
num = 1
for str in s :
    if num == k :
        str = str.lower()
    out += str
    num += 1


print(out)

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

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

Solution (Python):
l = list(map(int,input().split()))
words = input()
words = list(words)
words[l[1]-1] = words[l[1]-1].lower()

mojiretsu = ''.join(words)

print(mojiretsu)

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

s = ''.join(s)
print(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())
S=input()
for i in range(N):
    if i+1==K:
        print(S[i].lower(),end="")
    else: 
        print(S[i],end="")

Solution (Python):
nums = [int(e) for e in input().split()]
s=input()
print(s[:nums[1]-1]+s[nums[1]-1].lower()+s[nums[1]:])

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

sss = ""
for i, ss in enumerate(s):
    if i == b-1:
        ss = ss.lower()
    sss += ss
print(sss)

Solution (Python):
n=input().split()
S=input()
N=int(n[0])
K=int(n[1])
S_list=list(S)
if S[K-1]=="A":
 S_list[K-1]="a"
elif S[K-1]=="B":
 S_list[K-1]="b"
elif S[K-1]=="C":
 S_list[K-1]="c"
S="".join(S_list)
print(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"
s="".join(s)
print(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):
Nstr,Kstr=input().split()
S=input()
N=int(Nstr)
K=int(Kstr)-1

ans=""
i=0
for v in S:
	if(K==i):
		if (S[K]=="A"):
			ans=ans+"a"
		if (S[K]=="B"):
			ans=ans+"b"
		if (S[K]=="C"):
			ans=ans+"c"
	else:
		ans=ans+v
	i=i+1
print(ans)

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

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

print(S)

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

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

print("".join(S))

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()
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 = input().split()
s = input()
n = int(n)
k = int(k)
print(ｓ[: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):
from collections import defaultdict
from string import ascii_uppercase
import sys, bisect, math
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

N, K = read_int()
S = read_str()

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

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

Solution (Python):
a, b = map(int, input().split())
c = input()
c = list(c)
if (c[b-1] == 'A'):
    c[b-1] = 'a'
if (c[b-1] == 'B'):
    c[b-1] = 'b'
if (c[b-1] == 'C'):
    c[b-1] = 'c'
c = ''.join(c)
print('{}'.format(c))

Solution (Python):
def main():
    N, K = [int(n) for n in input().split()]
    S = list(input())
    
    num = K - 1
    char = S[num]
    if char == "A":
        S[num] = "a"
    elif char == "B":
        S[num] = "b"
    else:
        S[num] = "c"
    print("".join(S))
main()

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


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

y = "".join(s_lst)
print(y)

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

Solution (Python):
N, K = [int(x) for x 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=list(input())
S[K-1] = 'a' if S[K-1] == 'A' else 'b' if S[K-1] == 'B' else 'c'
print("".join(S))

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

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

Solution (Python):
N, K = (int(x) for x in input().split())
S = input()

con = {
    'A':'a',
    'B':'b',
    'C':'c'
    }
ans = []
for i,s in enumerate(S):
    if i == K-1:
        ans.append(con[S[K-1]])
    else:
        ans.append(S[i])

ans = ''.join(ans)
print(ans)

Solution (Python):
def solve():
    n, k = map(int, input().split())
    s = input()
    if len(s) != n:
        raise Exception('Error')
    s_l = list(s)
    s_l[k-1] = s[k-1].lower()
    s_n = "".join(s_l)
    print(s_n)

if __name__ == '__main__':
    solve()

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

Solution (Python):


import sys                                                      
sys.setrecursionlimit(10**6)                                    
from collections import deque, Counter                          
from itertools   import accumulate, permutations, combinations  
from operator    import itemgetter                              
from bisect      import bisect_left, bisect_right, bisect       
from heapq       import heappop, heappush                       
from fractions   import gcd                                     
from math        import ceil, floor, sqrt, cos, sin, tan, pi    
from copy        import deepcopy                                
import numpy         as np                                      


def main():
    
    im = InputManager()
    
    n, k = im.inputMultiple()
    s = im.inputSingle(dtype=str)
    
    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)
    
    return


class InputManager(object):
    def __init__(self):
        pass

    @staticmethod
    def inputSingle(dtype=int):
        return dtype(input())
    
    @staticmethod
    def inputMultiple(dtype=int, aslist=False):
        if aslist:
            return list(map(dtype, input().split()))
        else:
            return map(dtype, input().split())

    @staticmethod
    def input2D(h, dtype=int):
        return [list(map(dtype, input().split())) for i in range(h)]


main()

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


S_list = list(S)

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


S_changed = "".join(S_list)
print(S_changed)

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

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

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


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

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


if str[k-1] == "A":
    str_list[k-1] = 'a'
elif str[k-1] == "B":
    str_list[k-1] = 'b'
elif str[k-1] == "C":
    str_list[k-1] = 'c'


str_changed = "".join(str_list)
print(str_changed)

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

s = list(input())

for index, char in enumerate(s):
    if index == k-1:
        s[index] = char.lower()

print("".join(s))

Solution (Python):

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

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

Solution (Python):
import sys


def main():

    N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]
    S = list(sys.stdin.readline().rstrip())

    S_new = []
    for i, s in enumerate(S):
        if i + 1 == K:
            s = s.lower()
        S_new.append(s)

    print("".join(S_new))


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
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"
    
ch = ""
for i in a:
    ch += str(i)
print(ch)

Solution (Python):
n, k = [int(c) for c in 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()
S1 = S[:K-1]
S2 = S[K:]
target = S[K-1]
S3 = target.lower()
S = S1 + S3 + S2
print(S)

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

d = c[:b-1] + c[b-1].swapcase() + c[b:]  
print(d)

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

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

l = ""

for i in range(0, n):
    if i == k-1:
        s[i] = s[i].lower()
    l += s[i]

print(l)

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

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

out = ""

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


print(out)

Solution (Python):
a = input().split()
b = input()
tp = b[int(a[1])-1]
tp = tp.lower()
if int(a[1]) == 1:
	st = tp + b[1:len(b)]
elif int(a[1]) == int(a[0]):
  	st = b[0:len(b)-1] + tp
else:
  	st = b[0:int(a[1])-1] + tp + b[int(a[1]):len(b)]
print(st)

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

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

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

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

for ix, c in enumerate(S):
    if K == (ix + 1):
        print(c.lower(), end='')
    else:
        print(c, end='')

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, raw_input().strip().split())
s = raw_input().strip()
l = list(s)

x = l[k - 1]
y = chr(ord(x) + 32)
l[k - 1] = y

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

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

print(ans)

Solution (Python):


n, k = map(int, input().split())
s = input()
s_list= []
for c in s:
    s_list.append(c)
swapped = s_list[k - 1].swapcase()
s_list[k - 1] = swapped
ret = "".join(s_list)
print(ret)

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):
def main():
    N, K = map(int, input().split())
    S = input()

    if S[K-1] == 'A':
        new_S = S[0:K-1] + 'a' + S[K:N]
    elif S[K-1] == 'B':
        new_S = S[0:K-1] + 'b' + S[K:N]
    elif S[K-1] == 'C':
        new_S = S[0:K-1] + 'c' + S[K:N]

    print(new_S)


if __name__ == '__main__':
    main()

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

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

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

print("".join(S))

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    n, k = [int(i) for i in input().strip().split()]
    s = input().strip()
    print("".join([c.lower() if i == k else c for i, c in enumerate(s, start=1)]))


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 = (int(i) for i in input().split())
ans = ''
for i,a in enumerate(input()):
    if i == k-1:
        if a is 'A':
            a = 'a'
        elif a is 'B':
            a = 'b'
        else:
            a = 'c'
    ans += a
print(ans)

Solution (Python):

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

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

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

if N == 1:
    print(S.lower())
else:
    print(S[0:K-1] + S[K-1].lower() + S[K:])

Solution (Python):
a = input().split()
b = input()
c = ""
for i in range(len(b)):
  if i == int(a[1])-1:
    c += str(b[i].lower())
  else:
  	c += b[i]  

print(c)

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 = input()
ans=''
if s[k-1]=='A':
    ans=s[:k-1]+'a'+s[k:]
elif s[k-1]=='B':
    ans=s[:k-1]+'b'+s[k:]
elif s[k-1]=='C':
    ans=s[:k-1]+'c'+s[k:]
print(ans)

Solution (Python):
l = list(map(int, input().split()))
abc = str(input())
abc_list = list(abc)

abc_list[l[1]-1]=abc_list[l[1]-1].swapcase()

mojiretu = ''.join(abc_list)
    
print(mojiretu)

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

ss = ''
for u, v in enumerate(s):
    if u == k-1:
        ss = ss + v.lower()
    else:
        ss = ss + v
print(ss)

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

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

print(S)

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

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

if s[K-1]=="A":
    t="a"

elif s[K-1]=="B":
    t="b"

else:
    t="c"

print(s[:K-1]+t+s[K:])