stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.271823560364092x):
#include<stdio.h>

int main() {

    char S[100];

    int N,K;

    scanf("%d %d", &N, &K);

    scanf("%s", S);

    S[K-1] += 32;

    printf("%s\n", S);

    return 0;

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.292629679444871x):
#include<stdio.h>

int main(){

	int n,k;

	char s[255];

	scanf("%d %d",&n,&k);

	scanf("%s",&s);

    s[k-1] += 32;

	printf("%s\n",s);

	return 0;	

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.759177851906028x):
#include<stdio.h>

int main(){

	int n,k;

	char s[255];

	scanf("%d %d",&n,&k);

	scanf("%s",&s);

    s[k-1] += 32;

	printf("%s\n",s);

	return 0;	

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.28536169392961x):
#include<stdio.h>

int main(){

	int n,k;

	char s[255];

	scanf("%d %d",&n,&k);

	scanf("%s",&s);

    s[k-1] += 32;

	printf("%s\n",s);

	return 0;	

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.295989097201163x):
#include<stdio.h>

int main(){

	int n,k;

	char s[255];

	scanf("%d %d",&n,&k);

	scanf("%s",&s);

    s[k-1] += 32;

	printf("%s\n",s);

	return 0;	

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.272098610392622x):
#include<stdio.h>

int main(){

	int n,k;

	char s[255];

	scanf("%d %d",&n,&k);

	scanf("%s",&s);

    s[k-1] += 32;

	printf("%s\n",s);

	return 0;	

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.292353558292383x):
#include <stdio.h>



int main () {

    int N,K ;

    char S[100];

    scanf("%d %d", &N, &K) ;

    scanf("%s", &S) ;

    S[K-1] += 32 ; 

    printf("%s\n", S) ;

    return 0 ; 

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.758199169073123x):
#include <stdio.h>



int main () {

    int N,K ;

    char S[100];

    scanf("%d %d", &N, &K) ;

    scanf("%s", &S) ;

    S[K-1] += 32 ; 

    printf("%s\n", S) ;

    return 0 ; 

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.285085951954329x):
#include <stdio.h>



int main () {

    int N,K ;

    char S[100];

    scanf("%d %d", &N, &K) ;

    scanf("%s", &S) ;

    S[K-1] += 32 ; 

    printf("%s\n", S) ;

    return 0 ; 

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.295712800784892x):
#include <stdio.h>



int main () {

    int N,K ;

    char S[100];

    scanf("%d %d", &N, &K) ;

    scanf("%s", &S) ;

    S[K-1] += 32 ; 

    printf("%s\n", S) ;

    return 0 ; 

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.271823560364092x):
#include <stdio.h>



int main () {

    int N,K ;

    char S[100];

    scanf("%d %d", &N, &K) ;

    scanf("%s", &S) ;

    S[K-1] += 32 ; 

    printf("%s\n", S) ;

    return 0 ; 

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.290388538022423x):
#include <stdio.h>

int main ()

{

	int panjang, index;

	scanf ("%d %d\n", &panjang, &index);

	char karakter [panjang+10];

	scanf ("%s", &karakter);

	karakter[--index]+= 32;

	printf ("%s\n", karakter);

return (0);	

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.751234358202275x):
#include <stdio.h>

int main ()

{

	int panjang, index;

	scanf ("%d %d\n", &panjang, &index);

	char karakter [panjang+10];

	scanf ("%s", &karakter);

	karakter[--index]+= 32;

	printf ("%s\n", karakter);

return (0);	

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.283123630104574x):
#include <stdio.h>

int main ()

{

	int panjang, index;

	scanf ("%d %d\n", &panjang, &index);

	char karakter [panjang+10];

	scanf ("%s", &karakter);

	karakter[--index]+= 32;

	printf ("%s\n", karakter);

return (0);	

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.293746533247622x):
#include <stdio.h>

int main ()

{

	int panjang, index;

	scanf ("%d %d\n", &panjang, &index);

	char karakter [panjang+10];

	scanf ("%s", &karakter);

	karakter[--index]+= 32;

	printf ("%s\n", karakter);

return (0);	

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.269866162763637x):
#include <stdio.h>

int main ()

{

	int panjang, index;

	scanf ("%d %d\n", &panjang, &index);

	char karakter [panjang+10];

	scanf ("%s", &karakter);

	karakter[--index]+= 32;

	printf ("%s\n", karakter);

return (0);	

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.301691856729853x):
#include <stdio.h>



int main () {

    int N;

    int K;

    scanf("%d %d", &N, &K);

    char S[100];

    scanf("%s", S);

    S[K - 1]+= 32;

    printf("%s", S);



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.79129780091261x):
#include <stdio.h>



int main () {

    int N;

    int K;

    scanf("%d %d", &N, &K);

    char S[100];

    scanf("%s", S);

    S[K - 1]+= 32;

    printf("%s", S);



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294411426782007x):
#include <stdio.h>



int main () {

    int N;

    int K;

    scanf("%d %d", &N, &K);

    char S[100];

    scanf("%s", S);

    S[K - 1]+= 32;

    printf("%s", S);



    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305057026568027x):
#include <stdio.h>



int main () {

    int N;

    int K;

    scanf("%d %d", &N, &K);

    char S[100];

    scanf("%s", S);

    S[K - 1]+= 32;

    printf("%s", S);



    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.281125633850704x):
#include <stdio.h>



int main () {

    int N;

    int K;

    scanf("%d %d", &N, &K);

    char S[100];

    scanf("%s", S);

    S[K - 1]+= 32;

    printf("%s", S);



    return 0;

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.30342312323622x):
#include <stdio.h>

int main (){

	int n,k;

	char s[60] ;

	

	scanf("%d %d",&n ,&k);

	scanf("%s",&s);

	s[k-1] += 32;

	printf("%s",s);

	

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.79743409577339x):
#include <stdio.h>

int main (){

	int n,k;

	char s[60] ;

	

	scanf("%d %d",&n ,&k);

	scanf("%s",&s);

	s[k-1] += 32;

	printf("%s",s);

	

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.296140315865306x):
#include <stdio.h>

int main (){

	int n,k;

	char s[60] ;

	

	scanf("%d %d",&n ,&k);

	scanf("%s",&s);

	s[k-1] += 32;

	printf("%s",s);

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.306789391969989x):
#include <stdio.h>

int main (){

	int n,k;

	char s[60] ;

	

	scanf("%d %d",&n ,&k);

	scanf("%s",&s);

	s[k-1] += 32;

	printf("%s",s);

	

	

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.2828501844607505x):
#include <stdio.h>

int main (){

	int n,k;

	char s[60] ;

	

	scanf("%d %d",&n ,&k);

	scanf("%s",&s);

	s[k-1] += 32;

	printf("%s",s);

	

	

	return 0;

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.303635856779767x):
#include <stdio.h>



int main(){

	

	int num;

	int aci;

	char total[52];

	

	scanf("%d %d", &num, &aci);

	scanf("%s", &total);

	

	total[aci - 1] = total[aci - 1] + 32;

	

	printf("%s", total);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.79818810779013x):
#include <stdio.h>



int main(){

	

	int num;

	int aci;

	char total[52];

	

	scanf("%d %d", &num, &aci);

	scanf("%s", &total);

	

	total[aci - 1] = total[aci - 1] + 32;

	

	printf("%s", total);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.296352757277265x):
#include <stdio.h>



int main(){

	

	int num;

	int aci;

	char total[52];

	

	scanf("%d %d", &num, &aci);

	scanf("%s", &total);

	

	total[aci - 1] = total[aci - 1] + 32;

	

	printf("%s", total);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.30700226054298x):
#include <stdio.h>



int main(){

	

	int num;

	int aci;

	char total[52];

	

	scanf("%d %d", &num, &aci);

	scanf("%s", &total);

	

	total[aci - 1] = total[aci - 1] + 32;

	

	printf("%s", total);

	

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.283062092772354x):
#include <stdio.h>



int main(){

	

	int num;

	int aci;

	char total[52];

	

	scanf("%d %d", &num, &aci);

	scanf("%s", &total);

	

	total[aci - 1] = total[aci - 1] + 32;

	

	printf("%s", total);

	

	return 0;

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.301691856729853x):
#include <stdio.h>



int main(){

	int a, b;

	char str2 [100];

	

	scanf ("%d %d", &a, &b);

	scanf ("%s", str2);

	

	str2[b-1] = str2[b-1] + 32;

	

	printf("%s", str2);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define ll long long

#define ii pair<int, int>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define eb emplace_back

#define mp make_pair

#define mt make_tuple

#define ff first

#define ss second

#define pi 3.14159265

#define oo 1000000007

#define loo 10000000000000007



#define prime 1000000007



#define W(x) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << "\n";

using namespace std;

    

vi gr[100100];

int ans[100100];

int visi[100100];

deque<int> d;

map<ii, int> m;



int main(){

    ios::sync_with_stdio(false);

    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;

    string s; cin >> s;

    k--;

    s[k] += 'a'-'A';   

    cout << s << endl;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 18.79129780091261x):
#include <stdio.h>



int main(){

	int a, b;

	char str2 [100];

	

	scanf ("%d %d", &a, &b);

	scanf ("%s", str2);

	

	str2[b-1] = str2[b-1] + 32;

	

	printf("%s", str2);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



using ull=unsigned long long;

using vi=vector<int>;

using pii=pair<int, int>;

using ll=long long;



int main()

{

    int n, k;

    string s;



    cin >> n >> k >> s;



    s[k-1] = tolower(s[k-1]);



    cout << s << "\n"; 



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294411426782007x):
#include <stdio.h>



int main(){

	int a, b;

	char str2 [100];

	

	scanf ("%d %d", &a, &b);

	scanf ("%s", str2);

	

	str2[b-1] = str2[b-1] + 32;

	

	printf("%s", str2);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<string>



using namespace std;

int main(int argc, char *argv[])

{

	int n,k,i;

	string s;

	cin>>n>>k;

	cin>>s;

	s[k-1]=towlower(s[k-1]);

	cout<<s<<endl;

	

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305057026568027x):
#include <stdio.h>



int main(){

	int a, b;

	char str2 [100];

	

	scanf ("%d %d", &a, &b);

	scanf ("%s", str2);

	

	str2[b-1] = str2[b-1] + 32;

	

	printf("%s", str2);

	

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



typedef long long ll;

int main(){

  int n,k;

  string s;

  cin>>n>>k>>s;

  s[k-1]=s[k-1]+32;

  cout<<s;









}


// Faster C++ solution for the same problem (measured speedup: 5.281125633850704x):
#include <stdio.h>



int main(){

	int a, b;

	char str2 [100];

	

	scanf ("%d %d", &a, &b);

	scanf ("%s", str2);

	

	str2[b-1] = str2[b-1] + 32;

	

	printf("%s", str2);

	

	return 0;

}
// Slower C++ solution:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 2e5+5;



int main(){

    string s;

    int k;

    int n;

    cin >> n >> k >> s;

    s[k - 1] = s[k - 1] - 'A' + 'a';

    cout << s << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.303607415478167x):
#include <stdio.h>



int main(){



    int length;

    int lowercase;



    scanf("%d %d", &length, &lowercase);

    char kata[length];

    scanf("%s", kata);

    kata[lowercase-1]+=32;

    printf("%s", kata);



    return 0;

}