#include<bits/stdc++.h>
using namespace std;
#define MOD         998244353
#define speMOD      2933256077ll
#define int         long long
#define pii         pair<int,int>
#define all(v)      v.begin(),v.end()
#define pb          push_back
#define REP(i,b,e)  for(int i=(b);i<(int)(e);++i)
#define over(x)     {cout<<(x)<<endl;return;}
#define lowbit(x)   ((x)&(-(x)))
#define cntbit(x)   __builtin_popcount(x)
#define deal(v)     sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
mt19937 sd(random_device{}());
int qpow(int a,int b,int m=MOD,int res=1){
	a%=m;
	while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
	return res;
}
int exgcd(int x,int y,int &a,int &b){
	if(y==0){
		a=1;b=0;
		return x;
	}
	int d=exgcd(y,x%y,a,b);
	int z=b;
	b=a-b*(x/y);
	a=z;
	return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
	exgcd(x,y,_x_,_y_);
	return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
	fac[0]=inv[0]=1;
	REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
	inv[n]=qpow(fac[n],MOD-2);
	for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
	return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
string s,t;
int n,m;
int p[705][705];
int p2[705][705];
int f[705][705],g[705][705];
int nxt[705];
int myf[705];
void dfs(int l,int r){
	if(l&&r==(myf[l-1]? l:m+1)&&f[l][r]==l){
		REP(i,0,l)cout<<s[i];
		return;
	}
	if(l==0&&r==0)return;
	--l;
	REP(len,0,min(l,r)+1){
		int ml=l-len;
		nxt[m]=nxt[m+1]=m+1;
		for(int t=m-1;t>=0;--t){
			if(p[ml][t]>=l-ml+1)nxt[t]=t+len+1;
			else nxt[t]=nxt[t+1];
		}
		REP(p,0,r+1)if(nxt[p]==r&&f[l+1][r]==g[ml][p]+len+2){
			int x=ml;
			while(f[x][p]!=g[ml][p])--x;
			dfs(x,p);
			cout<<'*';
			REP(q,ml,l+1)cout<<s[q];
			return;
		}
	}
}
void Main() {
	cin>>s>>t;n=s.size();m=t.size();
	memset(p,0,sizeof(p));
	for(int i=n-1;i>=0;--i){
		for(int j=m-1;j>=0;--j){
			p[i][j]=s[i]==t[j]? p[i+1][j+1]+1:0;
		}
	}
	REP(i,0,n+1){
		REP(j,0,m+2){
			f[i][j]=g[i][j]=1e18;
		}
	}
	f[0][0]=0;
	bool F=1;
	REP(i,0,n){
		if(i>=m||t[i]!=s[i])F=0;
		f[i+1][F? i+1:m+1]=i+1;
		myf[i]=F;
	}
	REP(r,0,n){
		REP(i,0,m+2)g[r][i]=min(g[r][i],f[r][i]);
		if(r){
			REP(i,0,m+2)g[r][i]=min(g[r][i],g[r-1][i]);
		}
		REP(l,0,r+1){
			nxt[m]=nxt[m+1]=m+1;
			for(int t=m-1;t>=0;--t){
				if(p[l][t]>=r-l+1)nxt[t]=t+r-l+1;
				else nxt[t]=nxt[t+1];
			}
//			cout<<l<<' '<<r<<' '<<nxt[0]<<' '<<g[l][0]<<endl;
			REP(i,0,m+2)f[r+1][nxt[i]]=min(f[r+1][nxt[i]],g[l][i]+r-l+2);
		}
	}
//	REP(i,0,n+1){
//		REP(j,0,m+2)if(f[i][j]!=1e18)cout<<j<<' '<<f[i][j]<<"  ";
//		cout<<endl;
//	}
	int ans=n;
	REP(i,0,n+1)ans=min(ans,f[i][m+1]+(i<n));
	REP(i,1,n)if(m<n-i||p[i][m-n+i]<n-i){
		for(int j=m;j>=0;--j){
			REP(l,0,i)ans=min(ans,f[l][j]+(n-i)+1);
		}
	}
	if(ans==n)over(s)
//	cout<<f[n][m]<<endl;
	REP(i,0,n+1)if(ans==f[i][m+1]+(i<n)){
//		cout<<i<<endl;
		dfs(i,m+1);
		if(i<n)cout<<'*';
		return;
	}
	REP(i,1,n)if(m<n-i||p[i][m-n+i]<n-i){
		for(int j=m;j>=0;--j){
			REP(l,0,i)if(ans==f[l][j]+(n-i)+1){
//				cout<<l<<' '<<j<<' '<<i<<endl;
				dfs(l,j);
				cout<<'*';
				REP(p,i,n)cout<<s[p];
				return;
			}
		}
	}
}
void TC() {
    int tc=1;
	while(tc--){
		Main();
	}
}
signed main() {
	return cin.tie(0),cout.tie(0),ios::sync_with_stdio(0),TC(),0;
}
/*
1. CLEAR the arrays (ESPECIALLY multitests)
2. DELETE useless output
 */