#include <bits/stdc++.h>

using i64 = long long;

constexpr int inf = 1E9;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    std::string a, b;
    std::cin >> a >> b;
    
    int n = a.size(), m = b.size();
    
    std::vector lcp(n + 1, std::vector<int>(m + 1));
    for (int i = n - 1; i >= 0; i--) {
        for (int j = m - 1; j >= 0; j--) {
            lcp[i][j] = a[i] == b[j] ? lcp[i + 1][j + 1] + 1 : 0;
        }
    }
    
    std::vector dp(n + 1, std::vector<int>(m + 1, inf));
    std::vector g(n + 1, std::vector<std::pair<int, int>>(m + 1, {-1, -1}));
    dp[0][0] = 1;
    
    int ans = n;
    int l = 0, r = n;
    int x = 0;
    
    for (int i = 0; i <= n; i++) {
        if (i < n) {
            for (int j = 0; j <= m; j++) {
                dp[i + 1][j] = std::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) {
                    continue;
                }
                int v = dp[i][j] + k - i + 1;
                if (i == 0) {
                    v -= 1;
                    if (nxt != 0) {
                        nxt = m + 1;
                    }
                }
                if (k == n) {
                    v -= 1;
                    if (m < n - i || lcp[i][m - n + i] != n - i) {
                        nxt = m + 1;
                    }
                }
                if (nxt > m) {
                    if (v < ans) {
                        ans = v;
                        l = i, r = k;
                        x = j;
                    }
                } else if (dp[k][nxt + k - i] > v) {
                    dp[k][nxt + k - i] = v;
                    g[k][nxt + k - i] = {i, j};
                }
            }
        }
    }
    
    std::string p;
    if (r < n) {
        p += '*';
    }
    while (l >= 0) {
        for (int i = r - 1; i >= l; i--) {
            p += a[i];
        }
        if (l > 0) {
            p += '*';
        }
        while (l > 0 && dp[l][x] == dp[l - 1][x]) {
            l--;
        }
        r = l;
        std::tie(l, x) = g[l][x];
    }
    std::reverse(p.begin(), p.end());
    
    std::cout << p << "\n";
    
    return 0;
}