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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main () {

    char n[102];

    char k[102];



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

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



    return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main(){	

	char str1[100];

	char str2[100];

	

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

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

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main(){	

	char str1[100];

	char str2[100];

	

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

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main(){	

	char str1[100];

	char str2[100];

	

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

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main(){	

	char str1[100];

	char str2[100];

	

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

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main(){	

	char str1[100];

	char str2[100];

	

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

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

	

	return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main(){	

	char str1[100];

	char str2[100];

	

	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[100],T[100];

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[100];

	char str2[100];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main(){	

	char str1[100];

	char str2[100];

	

	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_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    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[100];

	char str2[100];

	

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

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

	

	return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main()

{

    char angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    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 angkas[102], angkat[102];

    scanf("%s %s", &angkas, &angkat);

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

    return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main(){

	char s[102], t[102];

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

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

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main(){

	char s[102], t[102];

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

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main(){

	char s[102], t[102];

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

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main(){

	char s[102], t[102];

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

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main(){

	char s[102], t[102];

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

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

	

	return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main(){

	char s[102], t[102];

	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[100],T[100];

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[102], t[102];

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

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

	

	return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main(){

	char s[102], t[102];

	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_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    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[102], t[102];

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

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

	

	return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main () {



	char orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    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 orangw[104];

	char orangq[104];



	scanf("%s %s",&orangw,&orangq);

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



return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main(){

	char name1[110];

	char name2[110];

	

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	return 0;

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



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

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

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

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

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

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

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

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

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

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

	int main() {

		char x[102];	

		char g[102];

		scanf ("%s %s", x, g);

		printf("%s%s", g ,x);

		

	  return 0;

	}