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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main() {

	char str1[105]; // 100 karakter

	char str2[105]; // 100 karakter

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

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

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main() {

	char str1[105]; // 100 karakter

	char str2[105]; // 100 karakter

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

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

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main() {

	char str1[105]; // 100 karakter

	char str2[105]; // 100 karakter

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

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

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main() {

	char str1[105]; // 100 karakter

	char str2[105]; // 100 karakter

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

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

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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



int main() {

    char aa[105], bb[105];

    scanf("%s %s", aa, bb);

    printf("%s%s", bb, aa);





    return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main() {

    char aa[105], bb[105];

    scanf("%s %s", aa, bb);

    printf("%s%s", bb, aa);





    return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main() {

    char aa[105], bb[105];

    scanf("%s %s", aa, bb);

    printf("%s%s", bb, aa);





    return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main() {

    char aa[105], bb[105];

    scanf("%s %s", aa, bb);

    printf("%s%s", bb, aa);





    return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main() {

    char aa[105], bb[105];

    scanf("%s %s", aa, bb);

    printf("%s%s", bb, aa);





    return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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

int main(){

	char s[105];

	char t[105];



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

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

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main(){

	char s[105];

	char t[105];



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

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

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main(){

	char s[105];

	char t[105];



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

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

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main(){

	char s[105];

	char t[105];



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

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

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main(){

	char s[105];

	char t[105];



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

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

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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



int main(){



	char word1[105];

	char word2[105];

	

	scanf ("%s %s", &word1, &word2);

	printf("%s%s\n",word2,word1);

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main(){



	char word1[105];

	char word2[105];

	

	scanf ("%s %s", &word1, &word2);

	printf("%s%s\n",word2,word1);

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main(){



	char word1[105];

	char word2[105];

	

	scanf ("%s %s", &word1, &word2);

	printf("%s%s\n",word2,word1);

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main(){



	char word1[105];

	char word2[105];

	

	scanf ("%s %s", &word1, &word2);

	printf("%s%s\n",word2,word1);

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main(){



	char word1[105];

	char word2[105];

	

	scanf ("%s %s", &word1, &word2);

	printf("%s%s\n",word2,word1);

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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

int main(){



char S[101],T[101];



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



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



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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main(){



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

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main(){



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

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main(){



char S[101],T[101];



scanf("%s %s", &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_in_out  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main(){



char S[101],T[101];



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



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



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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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

int main(){

	

	char name1 [100];

	char name2 [100];

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

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

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main(){

	

	char name1 [100];

	char name2 [100];

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

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

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main(){

	

	char name1 [100];

	char name2 [100];

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

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

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main(){

	

	char name1 [100];

	char name2 [100];

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main(){

	

	char name1 [100];

	char name2 [100];

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

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

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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

int main(){

	char a[100];

	char b[100];

	

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

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

	

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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

int main(){

	char a[100];

	char b[100];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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

int main(){

	char a[100];

	char b[100];

	

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

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

	

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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

int main(){

	char a[100];

	char b[100];

	

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

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

	

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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

int main(){

	char a[100];

	char b[100];

	

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

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

	

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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



int main()

{

	char S[107];

	char T[107];

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

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

	return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main()

{

	char S[107];

	char T[107];

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

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

	return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main()

{

	char S[107];

	char T[107];

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

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

	return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main()

{

	char S[107];

	char T[107];

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

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

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main()

{

	char S[107];

	char T[107];

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

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

	return 0;

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

#include <cstdio>



using namespace std;



#define MAXN 203

int main(){

    char S[MAXN],T[MAXN];

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

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

    return 0;

}


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



int main()

{

  char S[105];

  char T[105];

  scanf("%s", S);

  scanf("%s", T);

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

  return 0;

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

#include<iostream>

using namespace std;

int main(void){



    

    string s1,s2;

    cin >> s1 >>s2;

    s2 += s1;

    cout << s2;

    return 0;





}


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



int main()

{

  char S[105];

  char T[105];

  scanf("%s", S);

  scanf("%s", T);

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

  return 0;

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

using namespace std;

int main()

{

    char s[101],t[101];

    cin>>s>>t;

    cout<<t<<s<<endl;

}


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



int main()

{

  char S[105];

  char T[105];

  scanf("%s", S);

  scanf("%s", T);

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

  return 0;

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

using namespace std;



int main() {

    ios::sync_with_stdio(0);

    cin.tie(0);

    string a, b;

    cin >> a >> b;

    b += a;

    cout << b << "\n";

    return 0;

}

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



int main()

{

  char S[105];

  char T[105];

  scanf("%s", S);

  scanf("%s", T);

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

  return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


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



int main()

{

  char S[105];

  char T[105];

  scanf("%s", S);

  scanf("%s", T);

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

  return 0;

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



using namespace std;



int main()

{

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

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

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

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

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

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

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

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

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

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



int main(){

    char a[100], b[100];

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

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

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



int main(){

    char a[100], b[100];

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

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

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



int main(){

    char a[100], b[100];

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

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

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



int main(){

    char a[100], b[100];

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

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

}