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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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



int main() {

  char s1[101], s2[101];

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

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

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



int main() {

  char s1[101], s2[101];

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

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

  return 0;

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

using namespace std;

 

int main() {

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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



int main() {

  char s1[101], s2[101];

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

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

  return 0;

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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



int main() {

  char s1[101], s2[101];

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

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

  return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main() {

  char s1[101], s2[101];

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

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

  return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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



int main() {

  char s1[101], s2[101];

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

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

  return 0;

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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



int main (){

	char s[200];

	char t[200];

	

	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 a, b;

    cin>>a>>b;

    cout<<b+a;

}

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



int main (){

	char s[200];

	char t[200];

	

	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 a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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



int main (){

	char s[200];

	char t[200];

	

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

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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



int main (){

	char s[200];

	char t[200];

	

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

          cout<<b<<a<<endl;

return 0;

}


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



int main (){

	char s[200];

	char t[200];

	

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

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

	

	return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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



int main (){

	char s[200];

	char t[200];

	

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

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

	return 0;

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

using namespace std;

 

int main() {

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

	return 0;

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

	return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

	return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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



int main (){

	char x[105];

	char y[105];

	scanf("%s", &x);

	scanf("%s", &y);

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

	return 0;

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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



int main(){

	char string1[110];

	char string2[110];

	

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

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



int main(){

	char string1[110];

	char string2[110];

	

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

	printf("%s%s\n", 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<<endl;

}

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



int main(){

	char string1[110];

	char string2[110];

	

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

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

	

	

	

	

	return 0;

	

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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



int main(){

	char string1[110];

	char string2[110];

	

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

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

	

	

	

	

	return 0;

	

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main(){

	char string1[110];

	char string2[110];

	

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

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

	

	

	

	

	return 0;

	

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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



int main(){

	char string1[110];

	char string2[110];

	

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

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

	

	

	

	

	return 0;

	

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


// Faster C++ solution for the same problem (measured speedup: 5.341828766913572x):
#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<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.318486824600252x):
#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 <bits/stdc++.h>

using namespace std;

 

int main() {

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.341828766913572x):
#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 <bits/stdc++.h>

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315122300209921x):
#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>

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.334624807727916x):
#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.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3441501873544555x):
#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<bits/stdc++.h>

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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

int main () 

{

char a[200], b[200];

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

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

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

int main () 

{

char a[200], b[200];

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

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

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

using namespace std;

 

int main() {

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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

int main () 

{

char a[200], b[200];

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

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

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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

int main () 

{

char a[200], b[200];

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

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

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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

int main () 

{

char a[200], b[200];

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

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

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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

int main () 

{

char a[200], b[200];

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

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

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

	return 0;

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

using namespace std;

 

int main() {

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

	return 0;

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

	return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

	return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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

#include <string.h>



int main()

{

	char S[255],T[255];

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

	strcat(T,S);

	printf("%s",T);

	

	return 0;

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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

int main ()

{

	char S[105],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 a, b;

    cin>>a>>b;

    cout<<b+a;

}

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

int main ()

{

	char S[105],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 a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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

int main ()

{

	char S[105],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()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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

int main ()

{

	char S[105],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>>b;

          cout<<b<<a<<endl;

return 0;

}


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

int main ()

{

	char S[105],T[105];

	scanf("%s",&S);

	scanf("%s",&T);

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

	

	

	return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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

int main ()

{

	char S[105],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()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

}

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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

	

	return 0;

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

	

	return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

	

	return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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

int main(){

	

	char S[100];

	char T[100];

	

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

	getchar();

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

	

	return 0;

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

using namespace std;

int main()

{

    int i,c=0,n,j,p=0;

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;





    }


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



int main()

{

    char S[100];

    char T[100];



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



int main()

{

    char S[100];

    char T[100];



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

}

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



int main()

{

    char S[100];

    char T[100];



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

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



    return 0;

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

using namespace std;

int main()

{

    //freopen("input.txt", "r", stdin);

   // freopen("output.txt", "w", stdout);





    string a,b;



    cin >> a >> b;





    cout << b<<a;





    return 0;

}

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



int main()

{

    char S[100];

    char T[100];



    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;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main()

{

    char S[100];

    char T[100];



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

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



    return 0;

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

#include<string.h>

using namespace std;

int main()

{

    string s,t,x;

    cin>>s>>t;

    x=t+s;

    cout<<x<<endl;



    return 0;

}


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



int main()

{

    char S[100];

    char T[100];



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

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



    return 0;

}