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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

using namespace std;

int main()

{

string a,b,c;

cin>>a>>b;

c=a;

a=b;

b=c;

cout<<a<<b;

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

using namespace std;

typedef long long int ll;

int main()

{

    string t,s,a;

   while( cin>>s>>t)

   {

    a=t+s;

    cout<<a<<endl;

   }



}


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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t;

	int z,k=0;

	cin>>s>>t;

	cout<<t<<s<<'\n';

	

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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



using namespace std ;



int main()



{

    char str1[200], str2[200] ;



    cin>>str1>>str2 ;



    cout<<str2<<str1<<endl ;



    return 0;

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

using namespace std;

int main()

{

    char S[100],T[100];

    cin>>S>>T;



    cout<<T<<S<<endl;

    return 0;

}


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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

#include <cstdio>



using namespace std;



int main()

{

    string S,T,a;



    cin>>S;

    cin>>T;



    a=T+S;

    cout<<a;





    return 0;

}

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



int main(){

	char kata1[108]; //106 huruf	jadi dia [n] n-2

	char kata2[108]; // 106 huruf	ini juga

	

	scanf("%s %s", &kata1, &kata2); //bisa gapake &, sesuai aturan pointer

	printf("%s%s\n", kata2, kata1);

	

	return 0;

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

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 as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

int main(){

    string a, b;

    cin>> a >> b;

    cout<<b<<a;

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

int main()

{

string a,b,c;

cin>>a>>b;

c=a;

a=b;

b=c;

cout<<a<<b;

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

typedef long long int ll;

int main()

{

    string t,s,a;

   while( cin>>s>>t)

   {

    a=t+s;

    cout<<a<<endl;

   }



}


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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t;

	int z,k=0;

	cin>>s>>t;

	cout<<t<<s<<'\n';

	

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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



using namespace std ;



int main()



{

    char str1[200], str2[200] ;



    cin>>str1>>str2 ;



    cout<<str2<<str1<<endl ;



    return 0;

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

using namespace std;

int main()

{

    char S[100],T[100];

    cin>>S>>T;



    cout<<T<<S<<endl;

    return 0;

}


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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

#include <cstdio>



using namespace std;



int main()

{

    string S,T,a;



    cin>>S;

    cin>>T;



    a=T+S;

    cout<<a;





    return 0;

}

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



int main (){

	char as [103];

	char ad [103];

	scanf("%s %s",as,ad);

	printf("%s%s",ad,as);

	

	

	

	return 0;

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

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

int main(){

    string a, b;

    cin>> a >> b;

    cout<<b<<a;

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

int main()

{

string a,b,c;

cin>>a>>b;

c=a;

a=b;

b=c;

cout<<a<<b;

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

typedef long long int ll;

int main()

{

    string t,s,a;

   while( cin>>s>>t)

   {

    a=t+s;

    cout<<a<<endl;

   }



}


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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t;

	int z,k=0;

	cin>>s>>t;

	cout<<t<<s<<'\n';

	

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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



using namespace std ;



int main()



{

    char str1[200], str2[200] ;



    cin>>str1>>str2 ;



    cout<<str2<<str1<<endl ;



    return 0;

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

using namespace std;

int main()

{

    char S[100],T[100];

    cin>>S>>T;



    cout<<T<<S<<endl;

    return 0;

}


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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

#include <cstdio>



using namespace std;



int main()

{

    string S,T,a;



    cin>>S;

    cin>>T;



    a=T+S;

    cout<<a;





    return 0;

}

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



int main()

{

	char string1[102];

	char string2[102];

	

	scanf("%s %s",&string1,&string2);

	

	printf("\n%s%s",string2,string1);

	

	return 0;

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

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

int main(){

    string a, b;

    cin>> a >> b;

    cout<<b<<a;

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

int main()

{

string a,b,c;

cin>>a>>b;

c=a;

a=b;

b=c;

cout<<a<<b;

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

typedef long long int ll;

int main()

{

    string t,s,a;

   while( cin>>s>>t)

   {

    a=t+s;

    cout<<a<<endl;

   }



}


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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

#include <string>

using namespace std;



int main()

{

	string s,t;

	int z,k=0;

	cin>>s>>t;

	cout<<t<<s<<'\n';

	

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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



using namespace std ;



int main()



{

    char str1[200], str2[200] ;



    cin>>str1>>str2 ;



    cout<<str2<<str1<<endl ;



    return 0;

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

using namespace std;

int main()

{

    char S[100],T[100];

    cin>>S>>T;



    cout<<T<<S<<endl;

    return 0;

}


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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

#include <cstdio>



using namespace std;



int main()

{

    string S,T,a;



    cin>>S;

    cin>>T;



    a=T+S;

    cout<<a;





    return 0;

}

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



int main (){

	char a[105],b[105];

	

	scanf ("%s %s",a,b);

	printf ("%s%s",b,a);

	

	return 0;

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

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 S [101];

	char T [101];

	

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

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

	

	return 0;

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

using namespace std;

int main(){

    string a, b;

    cin>> a >> b;

    cout<<b<<a;

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

string a,b,c;

cin>>a>>b;

c=a;

a=b;

b=c;

cout<<a<<b;

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

using namespace std;

typedef long long int ll;

int main()

{

    string t,s,a;

   while( cin>>s>>t)

   {

    a=t+s;

    cout<<a<<endl;

   }



}


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



int main () {

	char S [101];

	char T [101];

	

	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;

	int z,k=0;

	cin>>s>>t;

	cout<<t<<s<<'\n';

	

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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



using namespace std ;



int main()



{

    char str1[200], str2[200] ;



    cin>>str1>>str2 ;



    cout<<str2<<str1<<endl ;



    return 0;

}

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



int main () {

	char S [101];

	char T [101];

	

	scanf ("%s %s", &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;

    return 0;

}


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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

#include <cstdio>



using namespace std;



int main()

{

    string S,T,a;



    cin>>S;

    cin>>T;



    a=T+S;

    cout<<a;





    return 0;

}

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



int main () {

	char S [101];

	char T [101];

	

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

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

	

	return 0;

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

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 str1[102];//S

	char str2[102];//T



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



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



	return 0;

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

using namespace std;

int main(){

    string a, b;

    cin>> a >> b;

    cout<<b<<a;

}

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



int main()

{	char str1[102];//S

	char str2[102];//T



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



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



	return 0;

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

#include<bits/stdc++.h>

using namespace std;



int main()

{

    string s1,s2;

    cin>>s1>>s2;

    cout<<s2<<s1;

    return 0;

}


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



int main()

{	char str1[102];//S

	char str2[102];//T



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



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



	return 0;

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

using namespace std;

int main()

{

	string A,T;

	cin>>A;

	cin.ignore();

	cin>>T;

	string C=T+A;

	cout<<C;

	return 0;

}

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



int main()

{	char str1[102];//S

	char str2[102];//T



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



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



	return 0;

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

using namespace std;

int main()

{

	string x;

	string y;

	cin>>x;

	cin>>y;

	string z;

	z=x;

	x=y;

	y=z;

	cout<<x<<y;

	

}

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



int main()

{	char str1[102];//S

	char str2[102];//T



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



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



	return 0;

}