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

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

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

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

Solution (Python):
a, b = map(int, raw_input().split())
c = raw_input()
m = b - 1
x = -1
w = ""
y = len(c)
ans = ""
for i in range(a):
    x = x + 1
    if x == m:
        z = c[x].lower()
    else:
        z = c[x]
    ans = ans + z
print ans

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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]
    print(ans)


if __name__ == '__main__':
    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()
ans = []
for i in range(n):
  if i + 1 == k:
    ans.append(s[i].lower())
  else:
    ans.append(s[i])
print(''.join(ans))

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

for i,v in enumerate(s):
	if k-1 == i:
		string += v.lower()
	else:
		string += v

print(string)

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

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


for ii in range(N):
  print(s[ii], end="")

Solution (Python):
N, K = map(int, input().split())
s = input()
res = ''
for i, ss in enumerate(s):
    if i == K - 1:
        res += ss.lower()
    else:
        res += ss
print(res)

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

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

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

print(A)

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

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

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

s1 = list(s)
s1[b-1] = s1[b-1].lower()

print("".join(s1))

Solution (Python):
import sys
rr = lambda: sys.stdin.readline().strip()
rri = lambda: int(rr())
rrs = lambda: [int(_) for _ in rr().split()]

N, K = rrs()
S = list(rr())

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

ss = ''

for s in S:
    ss += s

print(ss)

Solution (Python):
n,k = map(int,input().split())
k = k-1
a = list(input())

a[k] = a[k].lower()

print("".join(a))

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

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

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

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

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

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

print(R)

Solution (Python):
N, K = map(int, input().split())
s = list(input())
print("".join(s[:K-1]+ list(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):
s=list(map(int,input().split()))
t=list(input())
t[s[1]-1]=t[s[1]-1].swapcase()
print(''.join(t))

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

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

Solution (Python):
N,K=map(int,input().split())
S=input()
print(S[:K-1]+S.lower()[K-1:K]+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):
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()
ans = s[:K - 1] + s[K - 1].lower() + s[K:]
print(ans)

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

for i in range(1,N+1):
    if i == K :
        S[i-1] = S[i-1].swapcase()
print(''.join(S))

Solution (Python):
N,K=(int(x) for x in input().split())
S = input()
answer = []
txt = ord(S[K-1]) + 32
for i in range(N):
  if i == K-1:
    answer.append(chr(txt))
  else:
    answer.append(S[i])

print("".join(answer))

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())
ans=""
for i,s in enumerate(input()):
    if K==i+1:
        ans+=s.lower()
    else:
        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()
if n==k:
    print(s[:k-1]+s[k-1].lower())
else:
    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 = input()
j = -1
ans = ''
for i in range(N):
    j += 1
    if (K-1) == j:
        ans += str.lower(S[i])
    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"
elif S[K-1] == "C":
  S[K-1] = "c"

print("".join(S))

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

S = list(input())

myans =''
for i in range(N):
  if i+1 == K:
    myans += S[i].lower() 
  else:
    myans += S[i] 

print(myans)

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

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


rl = lambda: map(int,input().split())
rr = lambda N: [list(l) for l in zip(*[rl() for _ in range(N)])]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD = 10**9+7

N,K=rl()
S=input().rstrip()
dic = dict({'A':'a','B':'b','C':'c'})
print(S[:K-1]+dic[S[K-1]]+S[K:])

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

a[k-1] = a[k-1].lower()
b = ''.join(a)
print(b)

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

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

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 in range(n):
    if i == k - 1:
        print(s[i].lower(), end = '')
    else:
        print(s[i], end = '')

Solution (Python):



N_K = input().split(" ")

N = int(N_K[0])
K = int(N_K[1])

S = input()

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

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

if 'a' <= str1[b-1] and 'z'>=str1[b-1]:
    str1[b-1] = str1(str1[b-1]).upper()
    for s in str1:
        print(s, end="")
else:
    str1[b-1] = str(str1[b-1]).lower()
    for s in str1:
        print(s, end="")

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

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

if __name__ == '__main__':
    main()

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n,k=LI()
  s=list(S())

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

print(main())

Solution (Python):


import sys
import copy

sys.setrecursionlimit(1000000)





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

S = input().rstrip()

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

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

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


abc()

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

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

Solution (Python):
n,k=map(int, input().split())
str1 = str(input())
print(str1[:k-1]+str1[k-1].lower()+str1[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 solve():
	length, lowCase1BaseIdx = [int(x) for x in input().split()]
	originalStr = (input())
	strList = list(originalStr)
	lowerCase = strList[lowCase1BaseIdx - 1].lower()
	strList[lowCase1BaseIdx - 1] = lowerCase
	print(''.join(strList))
solve()

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

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

Solution (Python):


def main():
	n, k = map(int, input().split())
	s = input()
	new_s = ""
	for i, s_char in enumerate(s):
		if i+1 == k:
			new_s += s_char.lower()
		else:
			new_s += s_char
	print(new_s)

if __name__ == "__main__":
	main()

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

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

s0 = S[:K-1]
smid = S[K-1:K].lower()
s1 = S[K:]

print(s0 + smid + s1)

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

print(''.join(s_list))

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

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

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):
_, 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=input()
print(C[:B-1]+C[B-1].lower()+C[B:])

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

Solution (Python):
n1, n2 = [int(i) for i in input().split()]
s1 = input()
l1 = list(s1)
s2 = ""

for i1 in range(n1):
    if i1 == (n2 -1):
        l1[i1] = l1[i1] .lower()
    s2 +=l1[i1]

print(s2)

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

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

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

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

print(''.join(S_list))

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

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

s_changed="".join(s_list)
print(s_changed)

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

Solution (Python):
N, K = map(int, input().split())
K -= 1
S = input()
print(S[:K] + S[K].lower() + S[K + 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=str(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("".join([s[i].lower() if i == k-1 else s[i] for i in range(n)]))

Solution (Python):

N,K = map(int,raw_input().split())
S = list(raw_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())
k -= 1
mo = s.pop(k)

if mo == 'A':
    s.insert(k,'a')
elif mo == 'B':
    s.insert(k,'b')
else:
    s.insert(k,'c')

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

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

S[K-1] = chr(ord(S[K-1])+32)
print("".join(S))

Solution (Python):
N,K=map(int,input().split())
S=input()
K=K-1
def change(char):
    if char=="A":
        return "a"
    if char=="B":
        return "b"
    if char=="C":
        return "c"
print(S[:K]+change(S[K])+S[K+1:])

Solution (Python):
N,K=map(int,input().split())
S=input()
K=K-1
def change(char):
    if char=="A":
        return "a"
    if char=="B":
        return "b"
    if char=="C":
        return "c"
print(S[:K]+change(S[K])+S[K+1:])

Solution (Python):
N, K = [int(x) for x in 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"
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()
print(s[0: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 = list(input())
S[K-1] = S[K-1].lower()
s = ''.join(S)
print(s)

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

Solution (Python):
from sys import stdin
import string


s, k = [int(x) for x in stdin.readline().rstrip().split()]
b = stdin.readline().rstrip()

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

Solution (Python):
n, k = [int(v) for v in input().split()]
s = list(input())
s_k = s[k-1]
s[k-1] = chr(ord(s_k) - (ord('A') - ord('a')))
print("".join(s))

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

S_list=list(S)

ans=''
for i in range(len(S_list)):
	ans+=S_list[i].lower() if i==K-1 else S_list[i] 
print(ans)

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

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

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

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

print(ans)

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


print(''.join([(s.lower() if i == (K-1) else s) for (i, s) in enumerate(S)]))

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

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

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

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

Solution (Python):
N, K = map(int, input().split())
K = K-1
S = input()
ans = ""
for i, s in enumerate(S):
  if i == K:
    ans += s.lower()
  else:
    ans += s
print(ans)

Solution (Python):
if __name__ == '__main__':
    n, k = map(int, input().split())
    s = list(input())
    si = s[k-1]
    s[k-1] = si.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(' '))
sss = input()

ans = []
for i, S in enumerate(sss):
    i += 1
    if i == k:
        s = S.lower()
        ans.append(s)
    else:
        ans.append(S)

print("".join(ans))

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

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

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

ans = ""
cnt = 1
for i in S:
    if cnt == K:
        ans += i.lower()
    else:
        ans += i
    cnt += 1
        
print(ans)

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

list_s = list(s)
list_s[k - 1] = list_s[k-1].lower()
output = ''.join(list_s)

print(output)

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


s = input()
list = list(s)





list[m-1] = list[m-1].lower()
s = ''.join(list)


print(s)

Solution (Python):
N, K = map(int, raw_input().split())
word = raw_input()
newword = ""
for i in xrange(N):
  if i == K - 1:
    if word[i] == "A":
      newword += "a"
    elif word[i] == "B":
      newword += "b"
    else:
      newword += "c"
  else:
    newword += word[i]
    
print newword

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

if S[K-1] == 'A':
    S[K-1] = 'a'
elif S[K-1] == 'B':
    S[K-1] = 'b'
else:
    S[K-1] = 'c'
    
T = ''.join(S)

print(T)

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

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

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

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

Solution (Python):
in_1 = input().split(" ")

n = int(in_1[0])
k = int(in_1[1])
s = input()
arr = []
for i in range(n):
  arr.append(s[i])


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

s = ""
for i in range(n):
  s = s+arr[i]

print(s)

Solution (Python):

import sys


def solve(N: int, K:int, S:str):
    for i, s in enumerate(S):
        if i == K-1:
            print(s.lower(), end="")
        else:
            print(s, end="")
    print("")
    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()
S = s[k-1].lower()
print(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())
letters = list(input())
l = letters[k-1]
if l == "A":
  l = "a"
elif l == "B":
  l = "b"
elif l == "C":
  l = "c"
letters[k-1] = l  
for letter in letters:
  print(letter, end="")

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

s=str(input())

print(s[0:k-1],end='')
print(s[k-1].lower(),end='')
print(s[k:],end='')

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

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

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

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

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

Solution (Python):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq



import random


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

if __name__ == '__main__':
    main()

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

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

if isinstance(N,int)==1 and isinstance(K,int)==1 \
   and 1<=N<=50 and 1<=K<=N :

    S=input()
    null_char=S.replace('A','').replace('B','').replace('C','')

    if len(S)==N and S.isupper()==1 and not null_char:
        small_S=S[K-1:K].lower()
        print(S[:K-1] + small_S + S[K:])

    else :
        print("Unexpected parameter S")
        exit()

else :
    print("Unexpected parameter N or K")
    exit()

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

x=ord(s[k-1])
s[k-1]=chr(x+32)
y=''.join((x) for x in s)
print(y)

Solution (Python):
n,k=map(int,input().split())
s=input()
print(s[:k-1]+s[k-1].replace("A","a").replace("B","b").replace("C","c")+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()

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

print(ans)

Solution (Python):
n, k = map(int, input().split())
s = input()
ss = s[k-1].lower()
print(s[:k-1] + ss + 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())
t = input()
print("{}{}{}".format(t[:K-1], t[K-1:K].lower(), t[K:]))

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

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

print(S)

Solution (Python):

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

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

ans = []
for i in range(n):
    ans.append(s[i])
    
ans[k-1] = ans[k-1].lower()
print("".join(ans))

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 = [int(x) for x in input().split()]
S = list(input().strip())
l = {'A':'a', 'B':'b', 'C':'c'}
S[K-1] = l[S[K-1]]
print("".join(S))

Solution (Python):


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

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

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

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

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

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

print()

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

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

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

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

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 = [ int(v) for v 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()
SS=""
for i,s in enumerate(S):
    if i==K-1:
        if s=="A":
            s="a"
        if s=="B":
            s="b"
        if s=="C":
            s="c"
    SS+=s
print(SS)

Solution (Python):
NK = input().split()
N = int(NK[0])
K = int(NK[1])
S = input()
K = K - 1
S = list(S)
for i in range(N):
  if i == K:
    S[i] = S[K].swapcase()
s = ''.join(S)
print(s)

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

print(a)

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

convert_dict = {
    'A': 'a',
    'B': 'b',
    'C': 'c'
}

ans = ''

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

print(ans)

Solution (Python):

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

N = int(N)
K = int(K)

ans = S[:K-1]

if S[K-1] =="A":
    ans += "a"

if S[K-1] =="B":
    ans += "b"

if S[K-1] =="C":
    ans += "c"

ans += S[K:]


print (ans)

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:])
else:
  print(s[:k-1] + 'c' + s[k:])

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

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()]
s = input()
if k == 1:
    print(s[0].lower() + s[1:])
else:
    print(s[0: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 += str.lower(S[i]) 
    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):


N, K = map(int, input().split())
S = input()
ans = []
for i in range(N):
    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())
w = {"A":"a", "B":"b", "C":"c"}
s = list(input())
print(''.join([w[s[i]] if i == k-1 else s[i] for i in range(n)]))

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

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

Solution (Python):
n,k=input().split()
s=input()
k=int(k)-1
for i,c in enumerate(s):
	if i==k:c=chr(ord(c)+32)
	print(c,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()
ans = S[:K-1] + chr(ord(S[K-1]) + 32) + S[K:]
print(ans)

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

lst = list(s)
lst[K-1] = str.lower(lst[K-1])
print(''.join(lst))

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

Solution (Python):
import sys

from fractions import gcd





from itertools import accumulate













input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())



def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


if __name__ == '__main__':

    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    S = list(next(tokens))  

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

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

Solution (Python):

import re
import bisect
from datetime import datetime as dt
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)