stablegradients/pie-gem5-pairs huggingface dataset:
// 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.798087300541678x):
#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;

}
// 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.296324355032048x):
#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;

}
// 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.306973801188688x):
#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;

}
// 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.2830337617997145x):
#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;

}
// 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;

    char Str[100];

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

    scanf("%s", &Str);

    Str[K-1]= Str[K-1]+32;

    printf("%s", Str);

    

		

    

    

    

     

     

     

     

    

    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;

    char Str[100];

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

    scanf("%s", &Str);

    Str[K-1]= Str[K-1]+32;

    printf("%s", Str);

    

		

    

    

    

     

     

     

     

    

    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;

    char Str[100];

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

    scanf("%s", &Str);

    Str[K-1]= Str[K-1]+32;

    printf("%s", Str);

    

		

    

    

    

     

     

     

     

    

    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;

    char Str[100];

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

    scanf("%s", &Str);

    Str[K-1]= Str[K-1]+32;

    printf("%s", Str);

    

		

    

    

    

     

     

     

     

    

    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;

    char Str[100];

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

    scanf("%s", &Str);

    Str[K-1]= Str[K-1]+32;

    printf("%s", Str);

    

		

    

    

    

     

     

     

     

    

    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.3013271127946675x):
#include <stdio.h>



int main(){

	int x , y;

	char s [100];

	scanf ("%d %d", &x , &y);

	scanf ("%s", s ) ;

	if (s[y-1] >= 'A' && s[y-1] <= 'Z'){

		s[y-1] = s[y-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.790005003803238x):
#include <stdio.h>



int main(){

	int x , y;

	char s [100];

	scanf ("%d %d", &x , &y);

	scanf ("%s", s ) ;

	if (s[y-1] >= 'A' && s[y-1] <= 'Z'){

		s[y-1] = s[y-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.294047183723285x):
#include <stdio.h>



int main(){

	int x , y;

	char s [100];

	scanf ("%d %d", &x , &y);

	scanf ("%s", s ) ;

	if (s[y-1] >= 'A' && s[y-1] <= 'Z'){

		s[y-1] = s[y-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.304692051117068x):
#include <stdio.h>



int main(){

	int x , y;

	char s [100];

	scanf ("%d %d", &x , &y);

	scanf ("%s", s ) ;

	if (s[y-1] >= 'A' && s[y-1] <= 'Z'){

		s[y-1] = s[y-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.2807623048233x):
#include <stdio.h>



int main(){

	int x , y;

	char s [100];

	scanf ("%d %d", &x , &y);

	scanf ("%s", s ) ;

	if (s[y-1] >= 'A' && s[y-1] <= 'Z'){

		s[y-1] = s[y-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: 3.585789321868141x):
#include<bits/stdc++.h>

using namespace std;



int N,K;

string a;







int main(){

    cin>>N>>K>>a;

    a[K-1]=a[K-1]-'A'+'a';

    cout<<a;

}
// 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: 3.585889574091717x):
#include <bits/stdc++.h>

using namespace std;



int N,K;

string S;

char a;



int main() {

    cin>>N>>K>>S;

    S[K-1] = S[K-1] - 'A'+'a';

    cout <<S;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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

#include <string.h>



int main(){

	int N;

	int K;

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

	char S[N];

	scanf("%s", S);

	S[K-1] += 32;

	printf("%s", S);

	

	return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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



int main(){

    int a,b;

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

    char name[a];

    scanf("%s", name);

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

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

    return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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



int main(){

	int a,b;

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

	char string[a+1]="";

	scanf("%s", &string);

	string [b-1]+= 32;

	printf("%s", string);

	return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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

#include <string.h>



int main(){

	

	char name [55] ;

	int Fs, Sn ;

	

	scanf ("%d %d", &Fs, &Sn);

	scanf ("%s", &name);

	

	int Th = Sn-1 ;

	

	int X = name[Th] + 32;

	name[Th]= X;

	

	printf ("%s", name);

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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



int main(){

	int N,K;

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

	getchar();

	char S[N+2];

	scanf("%s", &S);

	S[K-1]+=32;

	printf("%s",S);



	

	return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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

#include <string.h>



int main() {



    int x, y;

    scanf("%d %d", &y, &x);

    char z[100];

    scanf("%s", z);

    z[x-1] += 32;

    printf("%s", z);



    return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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

int main ()

{

	int N,K ;

	char nama[52];

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

	nama[K-1]= nama[K-1]+32;

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

	return 0;

	

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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



int main(){

	

	int panjangkata, lowercase;

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

	char kata[panjangkata + 3];

	scanf("%s", &kata);

	kata[lowercase - 1] += 32;

	printf("%s", kata);



	

	return 0;

}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



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



   cout << s << endl;





}






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



int main (){

	

	int kata, lowercase;

	

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

	char  huruf [kata+5]; 

	scanf("%s",huruf); 

 	huruf [lowercase-1]+=32;

 	printf ("%s",huruf);

 	

	return 0;

}