#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using arr = array<int, 3>;
constexpr int maxn = 700 + 10;
string get(string a, string b, int c)
{
    if (c) reverse(a.begin(), a.end()), reverse(b.begin(), b.end());
    string t;
    while (t.size() < min(a.size(), b.size()) && a[t.size()] == b[t.size()]) t.push_back(a[t.size()]);
    if (t.size() != a.size()) t.push_back(a[t.size()]);
    if (a.size() != t.size()) t.push_back('*');
    if (c) reverse(t.begin(), t.end());
    return t;
}
const string &mx(const string &a, const string &b)
{
    return a.size() > b.size() ? b : a;
}
int f[maxn][maxn];
arr g[maxn][maxn];
int p[maxn][maxn];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string a, b;
    cin >> a >> b;
    string ans = mx(get(a, b, 0), get(a, b, 1));
    int n = a.size(), m = b.size();
    a.insert(a.begin(), ' ');
    b.insert(b.begin(), ' ');
    for (int i=1;i<=n+2;++i)
        for (int j=1;j<=m+1;++j) f[i][j] = 0x3f3f3f3f;
    for (int i=n;i>=1;--i)
        for (int j=m;j>=1;--j)
            p[i][j] = a[i] != b[j] ? 0 : p[i + 1][j + 1] + 1;
    for (int i=n;i>=1;--i)
    {
        for (int j=m;j>=1;--j)
        {
            f[i][j] = f[i + 1][j];
            g[i][j] = arr {i + 1, j, 0};
            int p = j;
            for (int k=1;k<=n-i+1;++k)
            {
                while (p <= m && ::p[i][p] < k) ++p;
                int q = min(m + 2, p + k);
                if (f[i + k][q] + k + 1 < f[i][j])
                {
                    f[i][j] = f[i + k][q] + k + 1;
                    g[i][j] = arr {i + k, q, 1};
                }
            }
        }
    }
    if (ans.size() <= f[1][1] + 1) cout << ans << '\n';
    else
    {
        ans.clear();
        int x = 1, y = 1;
        while (f[x][y])
        {
            auto [p, q, k] = g[x][y];
            if (k)
            {
                ans.push_back('*');
                for (int i=x;i<p;++i) ans.push_back(a[i]);
            }
            x = p; y = q;
        }
        ans.push_back('*');
        assert(ans.size() == f[1][1] + 1);
        cout << ans << '\n';
    }
    return 0;
}