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

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

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

Submission status: Accepted

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

#print(N,K,S)

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

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

Submission status: Accepted

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

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

x = ''.join(s)
print(x)

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

buf = ''
for i in range(N) :
    buf += S[i]
print(buf)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = [char.lower() if i+1==K else char for i, char in enumerate(input())]

print(''.join(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 = list(input())

C2c = {'A':'a', 'B':'b', 'C':'c'}
S[K-1] = C2c[S[K-1]]
print(''.join(S))

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:
N,K = map(int,input().split())
S = list(input())
a = S[K-1]
if a == 'A':
  S[K-1] = 'a'
elif a == 'B':
  S[K-1] = 'b'
elif a == 'C':
  S[K-1] = 'c'
for s in S:
  print(s, end ="")

Submission status: Accepted

Solution code:
n,k=map(int,raw_input().split())
s = raw_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:
# coding: utf-8 
#Author:Code
n, k = map(int, raw_input().split())
s = raw_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()

list_s = list(s)
list_s[k-1] = chr(ord(list_s[k-1]) + ord('a') - ord('A'))

print(''.join(list_s))

Submission status: Accepted

Solution code:
#import math.sqrt as sqrt

N, K= list(map(int, input().split()))
#B = list(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="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#H, W = map(int, input().split())
N, K = map(int, input().split())
S = str(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:])

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"
elif s[k-1] == "C":
  s[k-1] = "c"
 
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:
li = list(map(int,input().split()))	
s=list(input())
s[li[1]-1] = s[li[1]-1].lower();
print(''.join(s))

Submission status: Accepted

Solution code:
N,K=tuple(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])
elif S[K-1]=="C":
    print(S[0:K-1]+"c"+S[K:N])

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]
    else:
        ans += s[i].lower()
print(ans)

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:
cap = list("AaBbCc")

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

no = int(cap.index(s[k-1]))
s[k-1] = cap[no+1]

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

Submission status: Accepted

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

Submission status: Accepted

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

moji = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"

a = moji.index(S[K-1])
S[K-1] = moji[(a+26)%52]
print(''.join(S))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(N, K, S):
    """Test Case
    >>> print_ans(3, 1, "ABC")
    aBC
    >>> print_ans(4, 3, "CABA")
    CAbA
    """
    tmp = S[K - 1].lower()
    ans = [tmp if i == K - 1 else s for i, s in enumerate(S) ]
    print(''.join(ans))

if __name__ == '__main__':
    N, K = map(int, input().rstrip().split())
    S = input().rstrip()
    print_ans(N, K, S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = list(input())
if S[K - 1] == "A":
    S[K - 1] = "a"
    print("".join(S))
elif S[K - 1] == "B":
    S[K - 1] = "b"
    print("".join(S))
else:
    S[K - 1] = "c"
    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=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))



def main():
    m = {'A':'a', 'B':'b', 'C':'c'}
    n, k = rli()
    s = list(input())
    s[k-1] = m[s[k-1]]
    print("".join(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split()))
S = list(input())
temp = S[K-1].lower()
S[K-1] = temp
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 = (int(i) for i in input().split())
S = list(input())

S[K-1] = S[K-1].lower()
ans = str()
for i in S:
    ans += 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"
elif s[k-1] == "C":
  s[k-1] = "c"

print("".join(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = list(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 = list(input())
s[k-1]=s[k-1].lower()
print("".join(s))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, k = [int(s) for s in 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()

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

d={"A":"a","B":"b","C":"c"}

s[k-1]=d[s[k-1]]

print(*s,sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    N, K = LI()
    St = S()
    ans = St[0:(K-1)] + St[(K-1):K].lower() + St[K:]
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(cs))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF = 10**18


def input():
    return sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


for i in range(n):
    if i != k-1:
        print(s[i], end='')
    else:
        if s[i] == 'A':
            print('a', end='')
        elif s[i] == 'B':
            print('b', end='')
        else:
            print('c', end='')

Submission status: Accepted

Solution code:
# 2019-11-13 01:53:22(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    n, k = [int(x) for x in sys.stdin.readline().split()]
    s = list(sys.stdin.readline().rstrip())
    s[k-1] = s[k-1].lower()
    print(''.join(s))
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
S = input()
s = []
for i in range(N):
    x = S[i]
    if i == K-1:
        if x == 'A':
            x = 'a'
        elif x == 'B':
            x = 'b'
        else:
            x = 'c'
    s.append(x)
ans = s[0]
for i in range(1,N):
    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'
print("".join(s))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(A))

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

tmp = [si.lower() if i+1==k else si for i,si in enumerate(s)]
ret = "".join(tmp)

print(ret)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
l=list(input())
if l[m-1]=="A":
  l[m-1]="a"
elif l[m-1]=="B":
  l[m-1]="b"
else:
  l[m-1]="c"
print("".join(l))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
ls_s = [i for i in input()]
S = ""

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

for j in ls_s:
    S += j

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
n = tmp[0]
k = tmp[1]
s = input()

sl = []
for i in range(len(s)):
  if i == k-1:
    if s[i] == 'A':
      sl.append('a')
    elif s[i] == 'B':
      sl.append('b')
    else:
      sl.append('c')
  else:
    sl.append(s[i])

print (''.join(sl))

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:
#ABC126A - Changing a Character
N ,K = list(map(int,input().split()))
S = list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/bin/usr/python3
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

print(''.join(S))

Submission status: Accepted

Solution code:
# ABC 126: A – Changing a Character
n, k = [int(s) for s in 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 = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

t = k[s-1]

t = t.lower()

a = k[:s-1]+ t + k[s:]

#print(t)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
if K == 1:
    S = S[K-1].swapcase() + S[K:]
else:
    S = S[0:K-1] + S[K-1].swapcase() + S[K:]
print(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:
N, K = [int(x) for x in input().split()]
S = input()

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

ans = ''
for i in s:
    ans += i

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = (int(_) for _ in input().split())
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = (int(x) for x in 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()
s= s[:k-1] + s[k-1].lower() + s[k:]
print(s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, K: int, S: str):
    s = S[K - 1].lower()
    S = list(S)
    S[K - 1] = s
    S = "".join(S)
    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))  # type: int
    K = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    solve(N, K, S)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N , K = map(int, input().split())
s = input()
o = []
for i in range(N):
  if i == K - 1:
    o.append(s[i].lower())
  else:
    o.append(s[i])

print("".join(o))

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

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

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'
elif S[K - 1] == 'C':
    S[K - 1] = 'c'
print(''.join(S))

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
def main():
    n,k = [int(x) for x in input().split()]
    s = list(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    N,K =  map(int, input().split())
    S = input()
    K = K-1 #indexに置換
    lower = S[K].lower()
    if K == 0:
        result = lower + S[K+1:]
    else:
        result = S[:K] + lower + S[K+1:]
    print(result)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
list1 = list(input())
k = k-1
if list1[k] == "A":
    list1[k] = "a"
elif list1[k] == "B":
    list1[k] = "b"
elif list1[k] == "C":
    list1[k] = "c"

print("".join(list1))

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

Submission status: Accepted

Solution code:
N, k = map(int, input().split())
S = input()
ans = []
for i, s in enumerate(S):
  if i + 1 == k:
    ans.append(s.lower())
  else:
    ans.append(s)
print("".join(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(x) for x in input().split()]
s = input()

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

Submission status: Accepted

Solution code:
N,K=[int(x) for x in 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'
ans="".join(S)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 = [int(x) for x in input().split()]
S = input()
conv = {'A': 'a', 'B': 'b', 'C': 'c'}
for i, s in enumerate(S):
    if (i != K-1):
        print(s, end="")
    else:
        print(conv[s], end="")
print()

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
s=input()
d=[]
m=""
for i in range(n):
  d.append(s[i])
d[k-1]=s[k-1].swapcase()
for j in range(n):
  m+=d[j]
print(m)

Submission status: Accepted

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

Submission status: Accepted

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

for s in S:
    X.append(s)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(''.join(ss))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = str(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 = list(map(int,input().strip().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()

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

Submission status: Accepted

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

S_list = []
for i in range(N):
    S_list.append(S[i])

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

print(''.join(S_list))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N,K = map(int,readline().split())
S = read().rstrip().decode('utf-8')

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

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"
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:
INPUT = [input().split() for l in range(2)]
N = INPUT[0][0]
K = int(INPUT[0][1])
S = INPUT[1][0]

str_list = list(S)

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

str_changed="".join(str_list)

print(str_changed)

Submission status: Accepted

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

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

s = [val for val in s]

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

print("".join(s))

Submission status: Accepted

Solution code:
N, K = list(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(*S, sep='')

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:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    s = list(str(input().rstrip('\n')))
    for i in range(len(s)):
        if k - 1 == i:
            s[i] = s[i].lower()
    print("".join(s))


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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:
from sys import stdin

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

s = stdin.readline().rstrip()
r = s.lower()
string = ""
for i in range(a):
    if i == b-1:
        string += r[i]
    else:
        string += s[i]

print(string)

Submission status: Accepted

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

Submission status: Accepted

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

m=s[k-1]
mm=m.lower()
#print(mm)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S=list(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' 
print(''.join(S))

Submission status: Accepted

Solution code:
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'
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(*s, sep='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def perform(N, Q, A):
    Q = Q - 1
    return A[:Q] + A[Q].lower() + A[Q + 1:]

N, Q = map(int, input().strip().split())
A = input().strip()
#print(N, Q)
#print(A)
print(perform(N, Q, A))

Submission status: Accepted

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

Submission status: Accepted

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