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

	char T [102];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main() {

	char S [102];

	char T [102];

	

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



int main() {

	char S [102];

	char T [102];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

    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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

	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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

	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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

	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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

	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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

	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):
//input: S T

//output: ST



#include <stdio.h>



int main() {

	char ayam1 [102];

	char ayam2 [102];

	

	scanf("%s %s", &ayam1, &ayam2);

	printf("%s%s\n", ayam2, ayam1);

	

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

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

    printf("%s%s", r, 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], r[100];

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

    printf("%s%s", r, 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], r[100];

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

    printf("%s%s", r, 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], r[100];

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

    printf("%s%s", r, 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], r[100];

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

    printf("%s%s", r, 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], r[100];

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

    printf("%s%s", r, 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 nub[103];

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

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

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

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

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

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

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

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

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

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

	char nob[103];

	scanf("%s %s", &nub, &nob);

	printf("%s%s", nob, nub);

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

	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 depan[105];

	char belakang[105];

	

	scanf("%s %s", &depan, &belakang);

	printf("%s%s\n", belakang, depan);

	

	

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

	char T[102];

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

	char T[102];

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

	char T[102];

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

	char T[102];

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

	char T[102];

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

	char T[102];

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



int main() {

	

  char str1[102];

  char str2[102];

  

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



int main() {

	

  char str1[102];

  char str2[102];

  

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

}

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



int main() {

	

  char str1[102];

  char str2[102];

  

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

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

  

  

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

  char str2[102];

  

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

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

  

  

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

  char str2[102];

  

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

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

  

  

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

  char str2[102];

  

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

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

  

  

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

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

int main(){

	

	char stringa[120];

	char stringb[120];

	

	scanf ("%s %s", &stringa, &stringb);

	printf ("%s%s", stringb, stringa);

	

	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 str1[105];

	char str2[105];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

    string 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 str1[105];

	char str2[105];

	

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

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

	

	return 0;

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

using namespace std;

 

int main() {

    string 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 str1[105];

	char str2[105];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

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

	char str2[105];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main () {

	char str1[105];

	char str2[105];

	

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

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

	

	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 str1[105];

	char str2[105];

	

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

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

	

	return 0;

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

using namespace std;

int main()

{

    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.3404034996701215x):
#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()

{

    string a, b;

    cin>>a>>b;

    cout<<b+a;

}

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

    string a,b;

    cin>>a>>b;

    cout<<b+a<<endl;

}

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

{

    //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.313704158588394x):
#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()

{

          string a,b;

          cin>>a>>b;

          cout<<b<<a<<endl;

return 0;

}


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



int main() {

    char aa[105], bb[105];

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

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





    return 0;

}