#include <iostream>
#include <cmath>
#include <stack>
using namespace std;

#define LEFT 1
#define UP 2
#define SIKMO 3

struct Prvek{
	int c;
	int smer;
};


int main () {
	char p1[1001][11];
	char p2[1001][11];
	char sl[11];
	Prvek pr[1001][1001];
	int c1=0, c2=0;
	cin >> sl;
	while(true) {
		c1=0, c2=0;
		for (int i = 0; i < 1001; i++) {
			pr[i][1].smer = LEFT;
			pr[1][i].smer = UP;
		}
		while(strcmp(sl,".")) {
//  			cout<<sl<<endl;
			strcpy(p1[++c1],sl);
			cin >> sl;
			cin.ignore();
		}
		cin >> sl;
		while(strcmp(sl,".")) {
//  			cout<<sl<<endl;
			strcpy(p2[++c2], sl);
			cin >> sl;
			cin.ignore();
/* 			cout<<sl<<endl;*/
		}
		for (int i = 1; i <= c1; i++) {
			for (int j = 1; j <= c2; j++) {
				pr[i][j].c = max(pr[i-1][j].c,pr[i][j-1].c);
				if (strcmp(p1[i],p2[j])==0) {
					pr[i][j].c++;
					pr[i][j].smer = SIKMO;
// 					cout << "SIKMO\n";
				}
				else if (pr[i-1][j].c < pr[i][j-1].c) {
					pr[i][j].smer = LEFT;
				}
				else if (pr[i-1][j].c > pr[i][j-1].c) {
					pr[i][j].smer = UP;
				}
				else if (strcmp(p1[i],p2[j])>0){
					pr[i][j].smer = UP;
				}
				else pr[i][j].smer = LEFT;
			}
		}
		stack<char*> s;
		while (c1>0 || c2>0) {	
			if (pr[c1][c2].smer == LEFT) s.push(p2[c2--]);
			else if (pr[c1][c2].smer == UP) s.push(p1[c1--]);
			else {
// if(pr[c1][c2].smer != SIKMO)cout<<"!!!!!!!"<<endl;
				s.push(p2[c2--]);
				c1--;
			}
		}
		while (!s.empty()) {
			cout << s.top() << " ";
			s.pop();
		}
			cout << "." << endl;
			cin >> sl;
			if(!strcmp(sl, ".")) return 0;
	}
	return 0;
}