#include<bits/stdc++.h>
using namespace std;
//f i,j 最后一段最后一个字母<=i 匹配b最小位置是j的串shortest
const int N = 705;
char sa[N],sb[N],res[N];
struct Nd{
	int i,j;
}pre[N][N],ansp;
int n,m,f[N][N],ans,pos[N],cpos[N],lstp;
bool tmn(int &_x,int _v){
	if(_x>_v){
		_x = _v;
		return 1;
	}else return 0;
}
int main(){
	scanf("%s%s",sa+2,sb+1);
	sa[1] = '!';sb[0] = '?';
	n = strlen(sa+1);
	m = strlen(sb+1);
	sa[n+1] = '+';sb[m+1] = '-';
	memset(f,0x3f,sizeof(f));
	ans = **f;
	f[0][0] = 0;
	f[1][0] = 1;
	int aps,cps;
	char c;
	for(int i = 0;i<=n-2;i++){
		c = sa[i+2];
		aps = 0;
		for(int j = 1;j<=m;j++)if((i||j==1)&&sb[j]==c)pos[aps++] = j;
		if(i){
			for(int j = 0;j<=m;j++)
				if(tmn(f[i+1][j],f[i][j]))pre[i+1][j] = Nd{i,j};
		}
		for(int j = i+2;j<=n;j++){
			for(int k = 0,np = 0,v;k<=m;k++){
				if(f[i][k]>n)continue;
				v = f[i][k]+j-i;
				while(np<aps&&pos[np]<=k)np++;
				if(j==n&&(!aps||pos[aps-1]!=m-(n-i-2)))np = aps;
				if(np==aps){
					if(tmn(ans,v-(j==n)))ansp = Nd{i,k},lstp = j;
				}else if(tmn(f[j][pos[np]+j-i-2],v))pre[j][pos[np]+j-i-2] = Nd{i,k};
			}
			cps = 0;
			c = sa[j+1];
			for(int k = 0;k<aps;k++)if(c==sb[pos[k]+j-i-1])cpos[cps++] = pos[k];
			aps = cps;
			memcpy(pos,cpos,4*cps);
		}
	}
	cerr << ans << '\n';
	assert(ans<=n);
	res[ans+1] = '\0';
	if(lstp<n)res[ans--] = '*';
	for(int i = lstp;i>ansp.i+1;i--)res[ans--] = sa[i];
	res[ans--] = '*';
	Nd ls;
	while(ans>0){
		ls = pre[ansp.i][ansp.j];
		if(ls.i<ansp.i-1){
			for(int i = ansp.i;i>ls.i+1;i--)res[ans--] = sa[i];
			res[ans--] = '*';
		}
		ansp = ls;
	}
	printf("%s\n",res+1);
	return 0;
}