/*

    Student name: Fran Ante Loncar

    School name: V. gimnazija, Zagreb, Croatia

    Division: Senior

    Contest: #2

*/

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

using namespace std;

 

char p[30], a[10], s1[10], s2[10];

int poc, broj;

string rijec;

 

int main(){

    for(int m=0; m<5; ++m){

        getline(cin, rijec);

        for(int i=0; i<rijec.length(); ++i){

            p[i] = rijec.at(i);

        }

        int l = strlen(p);

        if(p[0] == 'D'){

            for(int i = 0; i<l; ++i){

                if(p[i] == ' '){

                    poc = i+1;

                    break;

                }

            }

            for(int i = poc; i<l; ++i){

                a[i-poc] = p[i];

            }

            for(int i = 0; i<4; ++i){

                s1[i] = a[i];

                s2[i] = a[4+i];

            }

            sort(s1, s1+4); sort(s2, s2+4);

            for(int i = 0; i<4; ++i){

                s1[4+i] = s1[i];

                s2[4+i] = s2[i];

            }

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

        }

        if(p[0] == 'A'){

            broj = p[3]-'0';

            for(int i = 0; i<broj; ++i){

                s1[i] = p[5+i];

                s2[i] = p[5+i];

            }

            sort(s2, s2+broj);

            for(int i = broj; i<8-broj; ++i){

                s2[i] = p[5+i];

            }

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

        }

        if(p[0] == 'S'){

            broj = p[8]-'0';

            for(int i = 10+broj; i<l; ++i){

                s1[i-10-broj] = p[i];

            }

            for(int i = 18-broj; i<l; ++i){

                s2[i-18+broj] = p[i];

            }

            sort(s2, s2+broj);

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

        }

        if(p[0] == 'U'){

            for(int i = 10; i<14; ++i){

                s1[i-10] = p[i];

            }

            sort(s1, s1+4);

            for(int i = l-8; i<l-4; ++i){

                s2[i-l+8] = p[i];

            }

            sort(s2, s2+4);

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

        }

        if(p[0] == 'I'){

            for(int i=0; i<2; ++i){

                s1[i] = p[i+10];

                s1[i+2] = p[i+10+6];

                s2[i] = p[i+10+8+1];

                s2[i+2] = p[i+10+8+1+6];

            }

            sort(s1, s1+4); sort(s2, s2+4);

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

        }

        memset(p, 0, sizeof(p));

        memset(s1, 0, sizeof(s1));

        memset(s2, 0, sizeof(s2));

        memset(a, 0, sizeof(a));

        rijec.clear();

    }

    return 0;

}