stablegradients/pie-gem5-pairs huggingface dataset:
// 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 x[102];	

		char g[102];

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

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

		

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



#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 x[102];	

		char g[102];

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

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

		

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main ()

{ 

	char st1[102]="ikan";

	char st2[102]="bakar";

	scanf("%s %s", &st1, &st2);

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

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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



 int main(){

 	char character;

	char char1[102];

    scanf("%s",char1 );

    

    char character2;

 	char char2[102]; 

	scanf("%s",char2 ); 

	

	printf("%s%s", char2,char1 );	



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



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.323037575192901x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.336156838698842x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.336156838698842x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.343867675210238x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.343362866762625x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.295821457884835x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.3456849538835725x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.399407063584715x):
#include<stdio.h>



int main(){



char S[105]; 

char T[105];

scanf("%s", &S); 

scanf("%s", &T);

printf("%s%s", 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.3094566782105685x):
#include <stdio.h>



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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



int main (){

	

	char s[105], t[103];

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

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.323748689601651x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.336869705734204x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.336869705734204x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.3445815723504735x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.344076696464569x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.29652893644227x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.346399093797419x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.400128380334293x):
#include<stdio.h>

int main()

{

char S[100];

char T[100];

scanf("%s",S);

scanf("%s",T);

printf("%s%s",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.311685510841267x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

	printf("%s%s\n", y, 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.318181137484078x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

	printf("%s%s\n", y, 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.331288431717757x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

	printf("%s%s\n", y, 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.331288431717757x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

	printf("%s%s\n", y, 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.338992233299065x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

	printf("%s%s\n", y, 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.3384878854100615x):
#include <stdio.h>





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

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

	

	

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





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

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

	

	

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





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

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

	

	

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





int main () 

{

	char x[100];

	char y[100];

	

	scanf("%s%s\n", &x,&y);

	

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

	

	

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

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

 	printf("%s%s", 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.321509310812541x):
#include<stdio.h>



int main(){

 	char S[100], T[100];

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

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

        return 0 ;

 }