// https://www.luogu.com/article/rvn2qn8x
#include<iostream>
#include<cstring>
#include<vector>
#include<tuple>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    string s, t;
    cin >> s >> t;
    const int n = s.size(), m = t.size();
    vector<vector<int> > lcp(n + 1, vector<int>(m + 1));
    for(int i = n - 1; i >= 0; i--){
        for(int j = m - 1; j >= 0; j--){
            if (s[i] == t[j]){
                lcp[i][j] = lcp[i + 1][j + 1] + 1;
            }
        }
    }
    
    const int INF = 1e9;
    vector<vector<int> > dp(n + 1, vector<int>(m + 1, INF));
    vector<vector<pair<int, int> > > pre(n + 1, vector<pair<int, int> >(m + 1, {-1, -1}));
    
    int l = -1, r = -1, x = -1, mn = INF;

    dp[0][0] = 1;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= m; j++){
            dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
        }
        for(int k = i + 1; k <= n; k++){
            int nxt = m + 1;
            for(int j = m; j >= 0; j--){
                if (lcp[i][j] >= k - i){
                    nxt = j;
                }
                if (dp[i][j] > INF / 2) continue;
                int val = dp[i][j] + k - i + 1;
                if (i == 0){
                    val -= 1;
                    if (nxt != 0) nxt = m + 1;
                }
                if (k == n){
                    val -= 1;
                    int len = k - i;
                    if (m - len < 0 or lcp[i][m - len] < len){
                        nxt = m + 1;
                    }
                }
                if (nxt > m){
                    if (val < mn){
                        mn = val;
                        l = i;
                        r = k;
                        x = j;
                    }
                }
                else if (val < dp[k][nxt + k - i]){
                    dp[k][nxt + k - i] = val;
                    pre[k][nxt + k - i] = {i, j};
                }
            }
        }
    }
    string ans;
    if (r != n) ans += "*";
    while(l >= 0){
        for(int i = r - 1; i >= l; i--){
            ans += s[i];
        }
        if (l != 0) ans += "*";
        while(l > 0 and dp[l][x] == dp[l - 1][x]){
            l -= 1;
        }
        r = l;
        tie(l, x) = pre[l][x];
    }
    reverse(ans.begin(), ans.end());
    cout << ans << '\n';

}