stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.231295948176009x):
//varun

#include <stdio.h>

//parshant

char S[110];

char T[110];



int main(){

scanf("%s%s",S,T);

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

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


// Faster C++ solution for the same problem (measured speedup: 5.275309904749667x):
//varun

#include <stdio.h>

//parshant

char S[110];

char T[110];



int main(){

scanf("%s%s",S,T);

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

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main (){

	char w1[101], w2[101];

	scanf ("%s %s", &w1, &w2);

	printf ("%s%s", w2, w1);

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main (){

	char w1[101], w2[101];

	scanf ("%s %s", &w1, &w2);

	printf ("%s%s", w2, w1);

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main (){

	char w1[101], w2[101];

	scanf ("%s %s", &w1, &w2);

	printf ("%s%s", w2, w1);

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main (){

	char w1[101], w2[101];

	scanf ("%s %s", &w1, &w2);

	printf ("%s%s", w2, w1);

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main (){

	char w1[101], w2[101];

	scanf ("%s %s", &w1, &w2);

	printf ("%s%s", w2, w1);

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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

 

 int main(){

 	

 	char S[110], T[110];

 	scanf("%s %s", &S, &T);

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

 	

 	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

 

 int main(){

 	

 	char S[110], T[110];

 	scanf("%s %s", &S, &T);

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

 	

 	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

 

 int main(){

 	

 	char S[110], T[110];

 	scanf("%s %s", &S, &T);

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

 	

 	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

 

 int main(){

 	

 	char S[110], T[110];

 	scanf("%s %s", &S, &T);

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

 	

 	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

 

 int main(){

 	

 	char S[110], T[110];

 	scanf("%s %s", &S, &T);

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

 	

 	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main()

{

	char s[105], t[105];

	

	scanf("%s", &s);

	scanf("%s", &t);

	

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

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main()

{

	char s[105], t[105];

	

	scanf("%s", &s);

	scanf("%s", &t);

	

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

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main()

{

	char s[105], t[105];

	

	scanf("%s", &s);

	scanf("%s", &t);

	

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

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main()

{

	char s[105], t[105];

	

	scanf("%s", &s);

	scanf("%s", &t);

	

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

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main()

{

	char s[105], t[105];

	

	scanf("%s", &s);

	scanf("%s", &t);

	

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

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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





int main(){

	

	char strg1[104]="%s";

	char strg2[104]="%s";

	

	scanf("%s %s", strg1, strg2);

	printf("%s%s", strg2, strg1);

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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





int main(){

	

	char strg1[104]="%s";

	char strg2[104]="%s";

	

	scanf("%s %s", strg1, strg2);

	printf("%s%s", strg2, strg1);

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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





int main(){

	

	char strg1[104]="%s";

	char strg2[104]="%s";

	

	scanf("%s %s", strg1, strg2);

	printf("%s%s", strg2, strg1);

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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





int main(){

	

	char strg1[104]="%s";

	char strg2[104]="%s";

	

	scanf("%s %s", strg1, strg2);

	printf("%s%s", strg2, strg1);

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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





int main(){

	

	char strg1[104]="%s";

	char strg2[104]="%s";

	

	scanf("%s %s", strg1, strg2);

	printf("%s%s", strg2, strg1);

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main(){

	char s1[110];

	char s2[110];

	

	scanf ("%s %s", &s1, &s2);

	printf ("%s%s", s2, s1);

	

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main(){

	char s1[110];

	char s2[110];

	

	scanf ("%s %s", &s1, &s2);

	printf ("%s%s", s2, s1);

	

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main(){

	char s1[110];

	char s2[110];

	

	scanf ("%s %s", &s1, &s2);

	printf ("%s%s", s2, s1);

	

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main(){

	char s1[110];

	char s2[110];

	

	scanf ("%s %s", &s1, &s2);

	printf ("%s%s", s2, s1);

	

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main(){

	char s1[110];

	char s2[110];

	

	scanf ("%s %s", &s1, &s2);

	printf ("%s%s", s2, s1);

	

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main(){

	

	char s[100],r[100];

	scanf("%s %s",&s,&r);

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

	

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main(){

	

	char s[100],r[100];

	scanf("%s %s",&s,&r);

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

	

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main(){

	

	char s[100],r[100];

	scanf("%s %s",&s,&r);

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

	

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main(){

	

	char s[100],r[100];

	scanf("%s %s",&s,&r);

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

	

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main(){

	

	char s[100],r[100];

	scanf("%s %s",&s,&r);

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

	

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main() {

	char str1[102];

	char str2[102];

	

	scanf("%s %s", &str1, &str2);

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

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main() {

	char str1[102];

	char str2[102];

	

	scanf("%s %s", &str1, &str2);

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

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main() {

	char str1[102];

	char str2[102];

	

	scanf("%s %s", &str1, &str2);

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

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main() {

	char str1[102];

	char str2[102];

	

	scanf("%s %s", &str1, &str2);

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

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main() {

	char str1[102];

	char str2[102];

	

	scanf("%s %s", &str1, &str2);

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

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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



int main(){

	

	char str1[105]="c";

	char str2[105]="t";

	scanf("%s %s",&str1,&str2);

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

	

	

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main(){

	

	char str1[105]="c";

	char str2[105]="t";

	scanf("%s %s",&str1,&str2);

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

	

	

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main(){

	

	char str1[105]="c";

	char str2[105]="t";

	scanf("%s %s",&str1,&str2);

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

	

	

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main(){

	

	char str1[105]="c";

	char str2[105]="t";

	scanf("%s %s",&str1,&str2);

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

	

	

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main(){

	

	char str1[105]="c";

	char str2[105]="t";

	scanf("%s %s",&str1,&str2);

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

	

	

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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





int main() {

    char str1[102]="run";

    char str2[102]="fast";

    scanf("%s %s", &str1, &str2);

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

    return 0;

    

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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





int main() {

    char str1[102]="run";

    char str2[102]="fast";

    scanf("%s %s", &str1, &str2);

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

    return 0;

    

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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





int main() {

    char str1[102]="run";

    char str2[102]="fast";

    scanf("%s %s", &str1, &str2);

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

    return 0;

    

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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





int main() {

    char str1[102]="run";

    char str2[102]="fast";

    scanf("%s %s", &str1, &str2);

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

    return 0;

    

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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





int main() {

    char str1[102]="run";

    char str2[102]="fast";

    scanf("%s %s", &str1, &str2);

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

    return 0;

    

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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

int main() {

	

	char character1[100];

	char character2[100];

	

	scanf("%s", character1);

	scanf("%s", character2);

	printf("%s%s", character2, character1);

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main() {

	

	char character1[100];

	char character2[100];

	

	scanf("%s", character1);

	scanf("%s", character2);

	printf("%s%s", character2, character1);

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main() {

	

	char character1[100];

	char character2[100];

	

	scanf("%s", character1);

	scanf("%s", character2);

	printf("%s%s", character2, character1);

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main() {

	

	char character1[100];

	char character2[100];

	

	scanf("%s", character1);

	scanf("%s", character2);

	printf("%s%s", character2, character1);

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main() {

	

	char character1[100];

	char character2[100];

	

	scanf("%s", character1);

	scanf("%s", character2);

	printf("%s%s", character2, character1);

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

    scanf("%s %s",S,T);

    printf("%s%s",T,S);

    return 0;

}


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

int main() {

	char str1[105]; // 100 karakter

	char str2[105]; // 100 karakter

	scanf("%s %s", &str1, &str2); // jessica (str1), priscilla (str2)

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

	return 0;

}