Problem:


Score : 100 points

Problem Statement

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

Constraints

1 ≤ N ≤ 50

1 ≤ K ≤ N

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

Input

Input is given from Standard Input in the following format:

N K
S

Output

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

Sample Input 1

3 1
ABC

Sample Output 1

aBC

Sample Input 2

4 3
CABA

Sample Output 2

CAbA



Sample input:
3 1
ABC


Sample output:
aBC

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = input()
dic = {"A": "a", "B": "b", "C": "c"}
print((s[:k-1] if k != 1 else "") + dic[s[k-1]] + (s[k:] if k < n else "") )

Submission status: Accepted

Solution code:
def solve(n, k, s):
    s = list(s)
    s[k-1] = s[k-1].lower()
    return "".join(s)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
li=list(input())
li[B-1]=li[B-1].lower()
for i in li:
    print(i,end="")

Submission status: Accepted

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

Submission status: Accepted

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

s = list(input())

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

ans = ''.join(s)

print(ans)

Submission status: Accepted

Solution code:
_len, _pos = map(str, input().split(' '))
literal = input()
new_letter = []
for count, fig in enumerate(literal):
    if count == int( _pos) -1: new_letter.append(fig.lower())
    else: new_letter.append(fig)

print(''.join(new_letter))

Submission status: Accepted

Solution code:
n, k = input().split()
s = input()
print(''.join([j.lower() if i == int(k)-1 else j for i,j in enumerate(s)]))

Submission status: Accepted

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

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

print(''.join(s))

Submission status: Accepted

Solution code:
n, k = input().split()
s = input()
result = ''.join([j.lower() if i == int(k)-1 else j for i,j in enumerate(s)])
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input().split()
N = int(str[0])
K = int(str[1])-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"

s = ""
for i in range(N):
    s = s + S[i]
    
print(s)

Submission status: Accepted

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

index = a[1] - 1
temp= s[index].lower()
s_list[index] = temp
s = "".join(s_list)
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S = input()
list = [b.lower() if a+1==K else b for (a,b) in enumerate(S)]
moji = ''.join(list)
print(moji)

Submission status: Accepted

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

ans = "".join(l)
print(ans)

Submission status: Accepted

Solution code:
#coding:utf-8
N,K = map(int,input().split())
S = str(input())
A = S[:K-1] + S[K-1].lower() + S[K:]
print(A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = [int(_) for _ in input().split()]
S = input()

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

print(result)

Submission status: Accepted

Solution code:
import sys
import collections

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = [int(i) for i in input().split(" ")]
s = input()
t = ""

for i in range(n):
    if i == k - 1:
        if s[i] == "A":
            t += "a"
        elif s[i] == "B":
            t += "b"
        else:
            t += "c"
    else:
        t += s[i]

print(t)

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S=str(input())
def change(A):
  if S[A]=="A":
    sub="a"
  elif S[A]=="B":
    sub="b"
  else:
    sub="c"
  return sub

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputNum = list(map(int,input().split()))
word = input()

print(word[:inputNum[1]- 1] + word[inputNum[1] - 1].lower() + word[inputNum[1]:] )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = list(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])
p = ''.join(ans)
print(p)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

s = list(s)

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


print("".join(s))

Submission status: Accepted

Solution code:
m = [int(i) for i in input().split(" ")]
string = input()
ans = ""

for n in range(m[0]):
    if n == m[1]-1:
        ans += string[n].lower()
    else:
        ans += string[n]

print(ans)

Submission status: Accepted

Solution code:
#abc126a

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(s))

Submission status: Accepted

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

Submission status: Accepted

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

for i,j in enumerate(S):
	if i+1 == int(K):
		S[i] = j.lower()
print("".join(S))

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split(' ')]
S = input()
print("".join([c if i!=K-1 else c.lower() for i, c in enumerate(S)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M=[int(i) for i in input().split()]
S=input()
print(S[:M-1]+S[M-1].lower()+S[M:])

Submission status: Accepted

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

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

print(''.join(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n=input()
num = n.split()
a=int(num[0])
b=int(num[1])

word = input()

res = word[0:b-1] + word[b-1].lower() + word[b:]

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list1=input().split(" ")
num1=int(list1[0])
num2=int(list1[1])
list2=input()
strings=""
for i in range(num1):
	if i==num2-1:
		strings+=list2[i].lower()    
	else:
		strings+=list2[i]
print(strings)

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = int(inputstr1[0])
k = int(inputstr1[1])
s = input()

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

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

Submission status: Accepted

Solution code:
read = input()
N,k = [int(s) for s in read.split()]
s = input()
k -= 1
s= s[:k] + str.lower(s[k]) + s[k+1:]
print(s)

Submission status: Accepted

Solution code:
def main():
	'''
	メイン関数
	'''
	# 文字列の長さN, 整数K
	N, K = map(int, input().split())

	# 文字列
	S = input()

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



if __name__ == '__main__':
	main()

Submission status: Accepted

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

str =input()

if str[K-1]=='A':
    out = str[0:K-1] + 'a' + str[K : N]
if str[K-1]=='B':
    out = str[0:K-1] + 'b' + str[K : N]
if str[K-1]=='C':
    out =str[0:K-1] + 'c' + str[K : N]

print(out)

Submission status: Accepted

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

    newStr = "{}{}{}".format(S[:K-1],S[K-1].lower() , S[K+1-1:])
    print(newStr)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

n, k = map(int, stdin.readline().split())
lst = list(stdin.readline().strip())
lst[k-1] = lst[k-1].lower()

print(''.join(lst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if s[k] == 'A':
    reply = 'a'
elif s[k] == 'B':
    reply = 'b'
elif s[k] == 'C':
    reply = 'c'

print(s[:k] + reply + s[k+1:])

Submission status: Accepted

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

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

print "".join(s_list)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,K = map(int, input().split())
S = input()
dir = {'A':'a', 'B':'b', 'C':'c'}

print(S[0:K-1] + dir[S[K-1]]+ S[K::])

Submission status: Accepted

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

S = input()

S_list = list(S)

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

S_changed = "".join(S_list)

print(S_changed)

Submission status: Accepted

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

    res = ''
    for i, c in enumerate(S):
        res += c.lower() if i + 1 == k else c

    print(res)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(newS)

Submission status: Accepted

Solution code:
N, K = map(int, raw_input().split())
S = raw_input()
ans = ''
for i in range(0, N):
	if i == K-1: ans = ans + chr(ord(S[i])+32)
	else: ans = ans + S[i]
print ans

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join([s[:k - 1], w, s[k:]]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

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

print("".join(S))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,k=map(int,input().split(" "))
s=input()
s=s[:k-1]+s[k-1].lower()+s[k:]
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k =map(int, input().split())  #複数数値入力
n = input()

a = n[k-1].lower()

print(n[:k-1]+a+n[k:])

Submission status: Accepted

Solution code:
dct = {"A":"a","B":"b","C":"c"}
n,m = map(int,input().split())
s = input()
print(s[:m-1]+dct[s[m-1]]+s[m:])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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="")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
s=input()
#print(s)
x=s[b-1]
if x=='A':
  x='a'
elif x=='C':
  x='c'
else:
  x='b'
t=s[0:b-1]+x+s[b:a]
print(t)

Submission status: Accepted

Solution code:
dict = {"A":"a", "B":"b", "C":"c"}
N, K = map(int, input().split())
S = list(input())
S[K-1] = dict[S[K-1]]
print("".join(map(str, S)))

Submission status: Accepted

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

#print(s)
#print(k)
#print(n)

s_list = list(s)

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

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

s = list(map)


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

s.pop(k-1)
s.insert(k-1,x)

print("".join(s))

Submission status: Accepted

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

Submission status: Accepted

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

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

s = "".join(s_list)

print(s)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in sys.stdin.readline().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v

def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


def main():
    N, K = li_input()
    S = input()

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

main()

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = str(input())
ans = ''
for n in range(N):
    if n == K-1:
        s = S[n].lower()
        ans += s
    else:
        ans += S[n]
print(ans)

Submission status: Accepted

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

a[m-1] = a[m-1].replace("A","a").replace("B","b").replace("C","c")
print("".join(a))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = str(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()

intn = int(n)
intk = int(k)

small = str.swapcase(s[intk -1])

answer = s[:intk-1] + small + s[intk:]

print(answer)

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()
 
N = int(n)
K = int(k)

ret = ""

for i in range(N):
  if i != K-1:
    ret += s[i]
  else:
    ret += s[i].lower()

print(ret)

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()

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

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()

N = int(n)
K = int(k)

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

Submission status: Accepted

Solution code:

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

k = int(k)
moji = s[(k-1):k]              #mojiという変数に変換したい文字を入れる
moji = str.lower(moji)         #小文字にする
s = s[:(k-1)] + moji + s[k:]   #連結する
k = str(k)

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()
chars = list(s)
a = int(k) - 1

chars[a]=chars[a].lower()
correct = "".join(chars)
print(correct)

Submission status: Accepted

Solution code:
wordLength,changePlace=input().split(" ")               #文字数と変える文字を読み込む
wordLength = int(wordLength)                            #int変換
changePlace = int(changePlace)                          #int変換
words = input()                                         #文字列の読み込み


words = list(words)                                     #strをリスト型に変換する
words[changePlace - 1] = words[changePlace - 1].lower() #リストの文字を置き換える
correct = "".join(words)                                #str型に戻す
print(correct)                                          #正解を出力する

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
nk = input().split()
n = int(nk[0])
k = int(nk[1])
str = input()

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

Submission status: Accepted

Solution code:
a=""
N,K=map(int,input().split())
S=input()
l=[]
for i,x in enumerate (S):
    if i==K-1:
        x=x.lower()
    l.append(x)
for i in range(N):
    a+=l[i]
print (a)

Submission status: Accepted

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

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

print(s[0:k-1] + tar + s[k:n+1])

Submission status: Accepted

Solution code:
firstLine = input()

# 文字列の長さ
N = int(firstLine.split()[0])
# 置き換えインデックス
K = int(firstLine.split()[1]) - 1

# 置き換え文字列
S = list(input())

if S[K] == 'A' or S[K] == 'B' or S[K] == 'C':
    S[K] = S[K].lower()
else:
    S[K] = S[K].upper()

print(''.join(S))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = input_str[0:k-1] + chr(ord(input_str[k-1]) + 32) + input_str[k:len(input_str)]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(sList))

Submission status: Accepted

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

sList=list(s)
sList[k-1]=sList[k-1].lower()
	
result=''
for i in range(n):
	result += sList[i]

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = [int(i) for i in input().split()]
s = input()

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

Submission status: Accepted

Solution code:
_, p = map(int, raw_input().split())
p = p - 1
s = raw_input()
print s[:p] + s[p].lower() + s[p+1:]

Submission status: Accepted

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

res = ''
for i, ss in enumerate(s, 1):
    if i != K:
        res += ss
    else:
        res += ss.lower()
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
for index, string in enumerate(list(S)):
    if index == K-1:
        print(string.lower(),end = '')
    else:
        print(string, end ='')

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
s = input()
swap = s[K-1].swapcase()
ans = s[:K-1] + swap + s[K:]
print(ans)

Submission status: Accepted

Solution code:
a,b = map(int,input().split(" "))
ar = list(input())
if ar[b-1] == "A":
    ar[b-1] = 'a'
elif ar[b-1] == "B":
    ar[b-1] = 'b'
elif ar[b-1] == "C":
    ar[b-1] = 'c'
print("".join(ar))

Submission status: Accepted

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

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

Submission status: Accepted

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

ss = {'A':'a', 'B':'b', 'C':'c'}
print(s[:k-1]+ss[s[k-1]]+s[k:])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys 

_, K = sys.stdin.readline().split(" ")
K = int(K)
S = sys.stdin.readline()
print("".join([S[:K-1], S[K-1].lower(), S[K:]]))

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
n, k = [int(x) for x in stdin.readline().rstrip().split()]
s = stdin.readline().rstrip()
tmp = ''
if k >= 2:
    tmp = s[:k - 1]
s = tmp + s[k - 1].lower() + s[k:]
print(s)

Submission status: Accepted

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

K -= 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

answer = S[:K-1] + target + S[K:]

print(answer)

Submission status: Accepted

Solution code:
m,k=map(int,input().split())
s=input()
print(s[:k-1],end="")
print(chr(ord(s[k-1])+32),end="")
print(s[k:])

Submission status: Accepted

Solution code:
N,K = (int(x) for x in input().split())
S = input()
if 1 <= N <= 50 and 1 <=K <= N and len(S) == N :
    komoji = S[K-1:K].lower()

    Out = S[:K-1] + komoji + S[K:]

    print(Out)

Submission status: Accepted

Solution code:
N,K = (int(x) for x in input().split())
s = input()
print(''.join([x if i != K-1 else x.lower() for i,x in enumerate(s) ]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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