#include<iostream>
#include<cstring>
using namespace std;

char preorder[ 30 ], inorder[ 30 ];

class Node
{
public:
	Node( char ele, Node * le = NULL, Node * ri = NULL )
		: element( ele ), left( le ), right ( ri ) {	}
	char element;
	Node *left;
	Node *right;
};

Node *root;

void plantTree( Node * & t, int begin, int end, int & i )
{
	if ( begin <= end )
	{
		char temp = preorder [ i ++ ];
		t = new Node( temp );

		int j;
		for ( j = begin; j <= end; j ++ )
			if ( inorder [j] == temp )
			{
				plantTree( t->left, begin, j - 1, i);
				plantTree( t->right, j + 1, end, i);
			}
	
	}
}

void printPostorder( Node * t )
{
	if ( t != NULL )
	{
		printPostorder( t->left );
		printPostorder( t->right );
		cout << t->element;
	}
}

int main()
{
	while ( cin >> preorder >> inorder )
	{
		int len = strlen( inorder );
		int temp = 0;
		plantTree( root, 0, len - 1, temp );
		printPostorder( root );
		cout << endl;
	}

	return 0;
}