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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K = map(int,input().split())
S = list(str(input()))
S[K-1] = S[K-1].lower()
s = str()
for i in range(N):
    s = s + S[i]
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
S = input()
ans = S[:K-1]+chr(ord(S[K-1])+32)
if K != N:
	ans = ans + S[K:]
print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import deque

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [N, K] = string_to_int(inputs[0])
    new_str = ""
    for i, c in enumerate(inputs[1]):
        if i == K-1:
            new_str += c.lower()
        else:
            new_str += c
    return new_str


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(2))
    print(ret)

Submission status: Accepted

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

p = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
s = str(input())
print(s[:m-1]+chr(ord(s[m-1])-ord("A")+ord("a"))+s[m:])

Submission status: Accepted

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

Submission status: Accepted

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

print(result)

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

Submission status: Accepted

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

if K < len(A):
    ans = A[:K-1] + A[K-1].lower() + A[K:]
else:
    ans = A[:K-1] + A[K-1].lower()
# print(ans)
print(A[:K-1] + A[K-1].lower() + A[K:])

Submission status: Accepted

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

if K < len(A):
    ans = A[:K-1] + A[K-1].lower() + A[K:]
else:
    ans = A[:K-1] + A[K-1].lower()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

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

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

print(''.join(s))

Submission status: Accepted

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

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

# solve
ans = ''
for i in range(len(S)):
    ans += S[i] if i != K - 1 else S[i].lower()

# output
print(ans)

Submission status: Accepted

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

    s[k-1] = s[k-1].lower()
    ans = []
    ans = "".join(map(str,s))
    print(ans)

main()

Submission status: Accepted

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

Submission status: Accepted

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

s = list(input())


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

print()

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
s = input()
if s[k-1:k] == 'A':
    s = s[0:k-1] +'a'+s[k::]
elif s[k-1:k] == 'B':
    s = s[0:k-1] +'b'+s[k::]
else:
    s = s[0:k-1] +'c'+s[k::]
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"
elif S[K-1]=="B":
    S[K-1]="b"
else:
    S[K-1]="c"
print(''.join(S))

Submission status: Accepted

Solution code:
def main():
    _, K = map(int, input().split())
    S = input()
    k = K - 1

    print(S[:k] + S[k].lower() + S[k+1:])


main()

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:
N, M = map(int, input().split())
s = input()
ans = ''
for i in range(N):
  if i == M-1:
    ans += s[i].lower()
  else:
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
N, K= [int(_) for _ in 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 = input()
new= s[:k-1] + s[k-1].lower() + s[k:]
print(new)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(newS)

Submission status: Accepted

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

for i in range(len(string)):
    if i == k - 1:
        print(chr(ord(string[i]) + 32), end="")
    else:
        print(string[i], end="")
print("")

Submission status: Accepted

Solution code:
#A, B, C からなる長さ N の文字列 S と、1 以上 N 以下の整数 K が与えられます。 
#文字列 S の K 文字目を小文字に書き換え、新しくできた S を出力してください。
n, k = map(int, input().split())
s = input()
print(s[:k - 1] + s[k - 1].lower() + s[k:])#スライス　a[始まりの位置: 終わりの位置: スライスの増分]
#k-1番目までをprint, k-1番目を小文字に変換，　k番目から最後まで出力

Submission status: Accepted

Solution code:
def resolve():
    n,k = map(int,input().split())
    s = input().strip()
    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'
    s = ''.join(s)
    print(s)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

li = []

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

print(''.join(li))

Submission status: Accepted

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

li = []

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

print(''.join(li))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
lst = list(input())
lst[b - 1] = lst[b - 1].lower()
print(''.join(lst))

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).replace(',',''))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC126-A
N,K = map(int,input().split())
S = list(input())
S[K-1] = S[K-1].lower()
S="".join(S)
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.append(s[i].lower())
    else:
        ans.append(s[i])

for j in range(n):
    print(ans[j], end="")

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N_mojiretsu, K_number = map(int, input().split())
L_mojiretsu = list(input())
L_mojiretsu[K_number-1] = L_mojiretsu[K_number-1].lower()
print(''.join(L_mojiretsu))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np
# import sys
# sys.setrecursionlimit(10**4)

def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


N, K = _li()
S = _s()

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

Submission status: Accepted

Solution code:
from sys import stdin
from collections import defaultdict

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

S = stdin.readline().rstrip()


if K == 1:
    S3 = list(S[0].lower())
else:
    S3 = list(S[0])
for i in range(1,N):
  if i+1 == K:
    S3.append(S[i].lower())
  else:
    S3.append(S[i])

S4 = ''.join(S3)
print(S4)

Submission status: Accepted

Solution code:
from sys import stdin
from collections import defaultdict

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

S = stdin.readline().rstrip().split()
S2 = ''.join(S)

if K == 1:
    S3 = list(S2[0].lower())
else:
    S3 = list(S2[0])
for i in range(1,N):
  if i+1 == K:
    S3.append(S2[i].lower())
  else:
    S3.append(S2[i])

S4 = ''.join(S3)
print(S4)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import bisect
from collections import defaultdict

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

    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=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())
target = S[K-1]
if target == "A":
    S[K-1] = "a"
elif target == "B":
    S[K-1] = "b"
else:
    S[K-1] = "c"

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())  # 複数数値入力
str = list(input())

if str[b-1] <= 'z' and str[b-1] >='a':
    str[b-1] = str[b-1].upper()
else:
    str[b-1] = str[b-1].lower()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(S[:K-1]+S[K-1].lower()+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())
st=input()
l=list(st)
l[k-1]=st[k-1].lower()
fi="".join(l)
print(fi)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = input()
print(s[:k-1] + s[k-1:k].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:
# -*- 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:
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


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % 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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

#print(s)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,n=map(int,input().split())
s=input()
print(s[:n-1]+s[n-1].lower()+s[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:
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()

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

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

print("".join(s1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(R)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
S=input()
print(S[:K-1]+S.lower()[K-1:K]+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"
else:
  s[k-1]="c"
print("".join(s))

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

print(myans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ri = lambda: int(input())
#rl = lambda: [int(x) if x.isdecimal() else x for x in input().split()]
#rl = lambda: list(input().split()))
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:])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
s = input()
a = s.lower()
print(s[:k-1] + a[k-1] + 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()
        print(''.join(s))
        exit()

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

Submission status: Accepted

Solution code:
# A
# Changing a Character

N_K = input().split(" ")

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

S = input()
#print(S)
print(S[:K-1], S[K-1].lower() ,S[K:], 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:
a, b = map(int, input().split())
str1 = list(input())  # 1文字区切りでリスト格納

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import copy

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~~~~

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

S = input().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(s_list))

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

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

Submission status: Accepted

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

Submission status: Accepted

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