#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;

struct TreeNode {

char val;
TreeNode* left;
TreeNode* right;
TreeNode(char x) : val(x), left(nullptr), right(nullptr) {}

};

TreeNode* buildTree(const string& preorder, int preStart, int preEnd,

                const string& inorder, int inStart, int inEnd,
                unordered_map<char, int>& inMap) {
if (preStart > preEnd || inStart > inEnd) {
    return nullptr;
}
char rootVal = preorder[preStart];
TreeNode* root = new TreeNode(rootVal);
int inRoot = inMap[rootVal];
int numsLeft = inRoot - inStart;
root->left = buildTree(preorder, preStart + 1, preStart + numsLeft,
                       inorder, inStart, inRoot - 1, inMap);
root->right = buildTree(preorder, preStart + numsLeft + 1, preEnd,
                        inorder, inRoot + 1, inEnd, inMap);
return root;

}

int computeLength(TreeNode* root) {

if (!root) {
    return 0;
}
if (!root->left && !root->right) {
    return 1;
}
int leftLength = computeLength(root->left);
int rightLength = computeLength(root->right);
return leftLength + rightLength;

}

void printConcave(TreeNode* root) {

if (!root) {
    return;
}
int length = computeLength(root);
cout << string(length, root->val) << endl;
printConcave(root->left);
printConcave(root->right);

}

int main() {

string preorder, inorder;
cin >> preorder >> inorder;
unordered_map<char, int> inMap;
for (int i = 0; i < inorder.size(); ++i) {
    inMap[inorder[i]] = i;
}
TreeNode* root = buildTree(preorder, 0, preorder.size() - 1,
                           inorder, 0, inorder.size() - 1, inMap);
printConcave(root);
return 0;

}