#include <bits/stdc++.h>
using namespace std;
#define MODS 100005
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define mp make_pair
#define pb push_back
#define test ll t;read(t);while(t--)
#define pll pair<ll,ll>
#define vvll vector<vector<ll>>
#define fst first
#define scd second
#define ins insert
#define line "\n"

#define forn(i,n) for(ll (i) = 0 ; (i) < (n) ; ++(i))
#define for1(i,n) for(ll (i) = 1 ; (i) <= (n) ; ++(i))
#define forr(i,n) for(ll (i) = (n)-1 ; (i)>=0 ; --(i))
#define forab(i,a,b,c) for(ll (i) = a ; (i) <= (b) ; (i)+=(c))

template <typename T>
void read(T &x){
    cin >> x;
}
template <typename T , typename T0>
void read(T &x,T0 &y){
    cin >> x >> y;
}

template <typename T , typename T0 , typename T1>
void read(T &x,T0 &y,T1 &z){
    cin >> x >> y >> z;
}

template <typename T , typename T0 , typename T1 , typename T2>
void read(T &x,T0 &y,T1 &z,T2 &w){
    cin >> x >> y >> z >> w;
}

template <typename T , typename T0>
void read(pair< T , T0 > &p){
    cin >> p.fst >>p.scd;
}

template <typename T>
void read(vector< T > &oneD,ll n){
    forn(i,n)
    {
        ll x;
        read(x);
        oneD.push_back(x);
    }
}

template <typename T>
void read(T oneD[] , ll n){
    for(ll i=0;i<n;i++){
        read(oneD[i]);
    }
}

template <typename T>
void write(T &x){

    cout << x << " ";
}

template <typename T , typename T0>
void write(T &x,T0 &y){
    cout << x << " " << y << "\n";
}

template <typename T , typename T0 , typename T1>
void write(T &x,T0 &y,T1 &z){
    cout << x << " " << y << " " << z << "\n";
}

template <typename T , typename T0 , typename T1 , typename T2>
void write(T &x,T0 &y,T1 &z,T2 &w){
    cout << x << " " << y << " " << z << " " << w << "\n";
}

template <typename T , typename T0>
void write(pair< T , T0 > &p){
    write(p.fst);
    write(p.scd);
    cout << line;
}

template <typename T>
void write(vector< T > &oneD,ll n){
    for(ll i=0;i<n;i++){
        cout<<oneD[i]<<" ";
    }
    cout << line;
}

template <typename T>
void write(T oneD[] ,int n){
    for(ll i=0;i<n;i++){
        write(oneD[i]);
    }
    cout <<line;
}

template <typename T , typename T0>
void write(map< T , T0 > &mpp){
    for(auto it : mpp){
        write(it.fst);
        cout << ": ";
        write(it.scd);
        cout << "\n";
    }
    cout<<line;
}
void write(vvll rc,ll n,ll m)
{
    forn(i,n)
    {
        forn(j,m)
        {
            cout<<rc[i][j]<<" ";
        }
        cout<<line;
    }
}
ll maxl(ll a,ll b)
{
    return (a>b)?a:b;
}
void solve()
{
    string a,b;
    read(a,b);
    a.insert(0,1,' ');
    b.insert(0,1,' ');
    ll n=a.length();
    ll m=b.length();
    vvll c(n,vll(m,0));
    for1(i,n-1)
    {
        for1(j,m-1)
        {
            if(a[i]==b[j])
            {
                c[i][j]=c[i-1][j-1]+1;
            }
            else
            {
                c[i][j]=maxl(c[i-1][j],c[i][j-1]);
            }
        }
    }
    string s;
    ll i=n-1;
//    write(a,b);
//    cout<<"";
//    forn(i,m)
//    {
//        cout<<b[i]<<" ";
//    }
//    cout<<line;
//    write(c,n,m);
    ll j=m-1;
    while(j>0 and i>0)
    {
//        write(i,j);
        if(c[i][j]==0)
            break;
        if(c[i-1][j-1]+1==c[i][j] and a[i]==b[j])
        {
            s.pb(b[j]);
            i--;
            j--;
            continue;
        }
        if(c[i][j-1]>c[i-1][j])
            j--;
        else
            i--;
    }
    reverse(all(s));
    cout<<s;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//*******************************************************//
solve();

return 0;
}




Measured memory_bytes: 70784