stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

#define len(x) (int) (x.size())

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 << '\n'; 

    

    return 0;

}

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



int main ()

{

    int n, k;

    char s[52];

    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 len(x) (int) (x.size())

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 << '\n'; 

    

    return 0;

}

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

int main(){

	int N;

	int K;

	char S[52];

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

	scanf("%s", &S);

	--K;

	S[K] = S[K] + 32;

	printf("%s", S);

	return 0;

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

#define len(x) (int) (x.size())

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 << '\n'; 

    

    return 0;

}

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



int main()

{

	char str1[100];

	int length, i;

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

		getchar();

	scanf("%s", str1);

	str1[i-1] = str1[i-1] + 32;

	printf("%s", str1);

	

	return 0;

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

#define len(x) (int) (x.size())

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 << '\n'; 

    

    return 0;

}

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

int main (){

int N,K;

char S [55];	

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

scanf("%s",S);	

--K;	

S[K]+=32;	

printf("%s",S);	

	return 0 ;

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

#define len(x) (int) (x.size())

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 << '\n'; 

    

    return 0;

}

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



int main(){

	int n;

	int k;

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

	char s[n+1];

	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: 3.5492704072554737x):
#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;

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

}
// 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.5581993506204546x):


#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;









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



int main(){

	int tc, n;

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

	char word[tc+2];

	scanf("%s", word);

	word[n-1]+=32;

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

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



int main(){

	int tc, n;

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

	char word[tc+2];

	scanf("%s", word);

	word[n-1]+=32;

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

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



int main(){

	int tc, n;

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

	char word[tc+2];

	scanf("%s", word);

	word[n-1]+=32;

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

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



int main(){

	int tc, n;

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

	char word[tc+2];

	scanf("%s", word);

	word[n-1]+=32;

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

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



int main(){

	int tc, n;

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

	char word[tc+2];

	scanf("%s", word);

	word[n-1]+=32;

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

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

#include <string.h>



int main(){

	int a , b;

	char c[100];

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

	getchar();

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

	printf("%s", c);

	

	

	

	

	

	

	

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

#include <string.h>



int main(){

	int a , b;

	char c[100];

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

	getchar();

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

	printf("%s", c);

	

	

	

	

	

	

	

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

#include <string.h>



int main(){

	int a , b;

	char c[100];

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

	getchar();

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

	printf("%s", c);

	

	

	

	

	

	

	

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

#include <string.h>



int main(){

	int a , b;

	char c[100];

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

	getchar();

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

	printf("%s", c);

	

	

	

	

	

	

	

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

#include <string.h>



int main(){

	int a , b;

	char c[100];

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

	getchar();

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

	printf("%s", c);

	

	

	

	

	

	

	

	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>

#include<string.h>

 

int main() {

  int K, N;

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

  char S[100];

  scanf("%s", S);

  S[K-1] += 32;

  printf("%s", S);

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

#include<string.h>

 

int main() {

  int K, N;

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

  char S[100];

  scanf("%s", S);

  S[K-1] += 32;

  printf("%s", S);

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

#include<string.h>

 

int main() {

  int K, N;

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

  char S[100];

  scanf("%s", S);

  S[K-1] += 32;

  printf("%s", S);

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

#include<string.h>

 

int main() {

  int K, N;

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

  char S[100];

  scanf("%s", S);

  S[K-1] += 32;

  printf("%s", S);

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

#include<string.h>

 

int main() {

  int K, N;

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

  char S[100];

  scanf("%s", S);

  S[K-1] += 32;

  printf("%s", S);

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

int main(){

	

	int K;

	int N;

	char S[52];

	

	scanf("%d %d %s", &N, &K, 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.78854507951221x):
#include <stdio.h>

int main(){

	

	int K;

	int N;

	char S[52];

	

	scanf("%d %d %s", &N, &K, 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.293635852907791x):
#include <stdio.h>

int main(){

	

	int K;

	int N;

	char S[52];

	

	scanf("%d %d %s", &N, &K, 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.304279893228856x):
#include <stdio.h>

int main(){

	

	int K;

	int N;

	char S[52];

	

	scanf("%d %d %s", &N, &K, 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.280352006201112x):
#include <stdio.h>

int main(){

	

	int K;

	int N;

	char S[52];

	

	scanf("%d %d %s", &N, &K, 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.2984575195893235x):
#include <stdio.h>

#include <string.h>

int main(){



char name[50];

char n;

int K, N;

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

scanf("%s", &name);

name[K-1] += 32;

printf("%s", name);



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

#include <string.h>

int main(){



char name[50];

char n;

int K, N;

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

scanf("%s", &name);

name[K-1] += 32;

printf("%s", name);



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

#include <string.h>

int main(){



char name[50];

char n;

int K, N;

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

scanf("%s", &name);

name[K-1] += 32;

printf("%s", name);



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

#include <string.h>

int main(){



char name[50];

char n;

int K, N;

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

scanf("%s", &name);

name[K-1] += 32;

printf("%s", name);



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

#include <string.h>

int main(){



char name[50];

char n;

int K, N;

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

scanf("%s", &name);

name[K-1] += 32;

printf("%s", name);



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

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

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

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

    char S[100];

    int N,K;

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

    scanf("%s", S);

    S[K-1] += 32;

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

    return 0;

}