#include <bits/stdc++.h>
using namespace std;
#define J string
#define pii pair<int,int>
#define fi first
#define se second
const int maxn=710;
int n,m;
char s[maxn],t[maxn];
int f[maxn][maxn][2],lcp[maxn][maxn];
pii pre[maxn][maxn][2];
int ans;
J ans_str;
inline J solve(int x,int y)
{
	if(x<=0)return "";
	if(f[x][y][0]<f[x][y][1])
	{
		int px=pre[x][y][0].fi,py=pre[x][y][0].se;
		return solve(px,py)+'*';
	}
	int px=pre[x][y][1].fi,py=pre[x][y][1].se;
	J res=solve(px,py);
	for(int i=px+1;i<=x;i++)res+=s[i];
	return res;
}
vector<int> pos;
signed main()
{
	scanf("%s",s+1);scanf("%s",t+1);
	n=strlen(s+1);m=strlen(t+1);
	for(int i=n;i>=1;i--)
	{
		for(int j=m;j>=1;j--)lcp[i][j]=((s[i]!=t[j])?0:1+lcp[i+1][j+1]);
	}
	memset(f,0x3f,sizeof(f));
	f[0][0][0]=0;
	ans=n;
	for(int i=1;i<=n;i++)ans_str+=s[i];
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=m;j++)
		{
			for(int fl=0;fl<2;fl++)
			{
				if(i==n || f[i][j][fl]>1e9)continue;
				int val=f[i][j][fl];
				//printf("f[%d][%d][%d]:%d\n",i,j,fl,f[i][j][fl]);
				//not choose
				for(int k=i+1;k<=n;k++)
				{
					if(val+1>f[k][j][0])continue;
					f[k][j][0]=val+1;pre[k][j][0]=make_pair(i,j); 
				}
				//choose
				if(fl==1)continue;
				pos.clear();
				for(int k=j+1;k<=m;k++)
				{
					if(pos.empty() || lcp[i+1][k]>lcp[i+1][pos.back()])pos.push_back(k);
				}
				int ed=0;
				for(int k=i+1;k<=n;k++)
				{
					while(ed<pos.size() && lcp[i+1][pos[ed]]<k-i)ed++;
					int len=k-i;
					if(k==n)//case 1:directly dismatch
					{
						if(((i==0 && j==0) || (m-len+1<=j || lcp[i+1][m-len+1]<len)))
						{
							if(val+len>=ans)continue;
							//upd ans
							ans=val+len;ans_str=solve(i,j);
							for(int r=i+1;r<=k;r++)ans_str+=s[r];
						}
					}
					else
					{
						if(ed>=(int)pos.size() || (i==0 && j==0 && lcp[i+1][j+1]<len))
						{
							if(val+len+1>=ans)continue;
							ans=val+len+1;ans_str=solve(i,j);
							for(int r=i+1;r<=k;r++)ans_str+=s[r];
							ans_str+='*';
						}
						else//match
						{
							int npos=pos[ed];
							if(val+len<f[k][npos+len-1][1])
							{
								f[k][npos+len-1][1]=val+len;
								pre[k][npos+len-1][1]=make_pair(i,j);
							}
						}
					}
				}
			}
		}
	}
	assert(ans_str.length()==ans);
	for(int i=0;i<ans;i++)putchar(ans_str[i]);
	return 0;
}