Following Orders

        
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122

        /**
 * Author by Rainboy blog: https://rainboylv.com github : https://github.com/rainboylvx
 * date: 2025-12-18 10:14:48
 */
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
using namespace std;
typedef  long long ll;
typedef  unsigned long long ull;

const int maxn = 300;
int n,m;
int sz;
char a[maxn]; //所有字符

bool del[maxn];
int indg[maxn]; //每个点的入度

int g[maxn][maxn]; //邻居矩阵
char topsort[maxn];

std::string s;


void dfs(char u,int dep) {

    topsort[dep] = u;
    del[u] = 1;
    // std::cout << "dfs > " << u << "  >dep = " << dep << "\n";

    if( dep == sz) { //删除的点已经结束了
        // std::cout << "-------------------------" << "\n";
        for(int i = 1;i <= sz ;++i ) // i: 1->n
            cout << topsort[i];
        std::cout << "\n";
        // std::cout << "-------------------------" << "\n";
        del[u] = 0;
        return ;
    }

    // 删除u周围的点
    for(int i = 1;i <= sz ;++i ) // i: 1->sz
    {
        char c = a[i];
        if( del[c] == 0 && indg[c] > 0 && g[u][c])
            indg[c]--;
    }

    // 开始遍历 
    for(int i = 1;i <= sz ;++i ) // i: 1->sz
    {
        char c = a[i];
        if( del[c] == 0 && indg[c] == 0)
            dfs(c,dep+1);
    }

    // 恢复u周围的点
    for(int i = 1;i <= sz ;++i ) // i: 1->sz
    {
        char c = a[i];
        // u周围的点的值都有添加+1,因为相当于把u恢复了
        if( del[c] == 0 && g[u][c])
            indg[c]++;
    }

    del[u] = 0;

}

signed main () {
    ios::sync_with_stdio(false); cin.tie(0);

    while( getline(cin,s) ) {

        memset(g,0,sizeof(g));
        memset(indg,0,sizeof(indg));
        memset(del,0,sizeof(del));

        sz = 0;
        for(int i = 0 ;i < s.length() ;i++) 
        {
            if( s[i] < 'a' || s[i] > 'z') continue;
            a[++sz]  = s[i];
        }
        std::sort(a+1,a+1+sz); // 排序

        getline(cin,s);

        //依次处理每个元素字符
        int first = 1;
        char st,ed;
        for(int i = 0 ;i < s.length() ;i++) {
            char c = s[i];
            if( c <'a' || c > 'z') continue;// 不是合法的字符,可能是空格
            if( first )  {
                st = c;
            }
            else {
                ed = c;
                g[st][ed] = 1; //存图
                indg[ed]++;
                // std::cout << st << " " << ed << endl;
            }
            first ^=1;
        }

        for(int i = 1 ;i<=sz;i++) {
            char c = a[i];
            if( indg[c] == 0) {
                dfs(c,1);
            }
        }
        std::cout << "\n";

    }
    
    return 0;
}