#include<bits/stdc++.h>
using namespace std;

# define C continue;
# define R return

# define D double
# define I insert
# define ll long long
# define ld long double

# define ull unsigned long long
# define ui unsigned int

# define pb push_back
# define pf push_front

# define vi vector < int >
# define vc vector < char >
# define vs vector < string >
# define vb vector < bool >
# define vd vector < D >
# define vll vector < ll >
# define vull vector < ull >
# define vld vector < ld >
# define PQ priority_queue

# define vvi vector < vector < int > >
# define vvb vector < vector < bool > >
# define vvc vector < vector < char > >
# define vvs vector < vs >
# define vvll vector < vector < ll > >
# define vvd vector < vector < D > >
# define vvld vector < vector < ld > >

# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) v.begin() , v.end() , comp
# define allrevcomp(v) v.rbegin() , v.rend() , comp

# define pii pair < int , int >
# define pll pair < ll , ll >
# define pld pair < ld , ld >
# define pDD pair < D , D >

# define vpld vector < pld >
# define vpii vector < pii >
# define vpll vector < pll >
# define vpDD vector < pDD >

# define vvpii vector < vector < pii > >
# define F first
# define S second
# define mp make_pair

# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))

# define pp(n) printf("%.10Lf",n);
# define line cout<<"\n";
# define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);

string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};

const int dx[] = { -1 , 0 , 1 , 0 } ;
const int dy[] = { 0 , 1 , 0 , -1 } ;

const ld pie = 3.1415926535897932384626 ;
const ll mod = 1e9 + 7 ;

/// Tip : If a and b are positive integers ; we may say - ceil (a/b) = 1 + floor ( (a-1)/b ) .

void solve ( int test_case )
{
    string a , b ;
    cin >> a >> b ;

    int aa = a.size() ;
    int bb = b.size() ;

    vvi dp ( aa + 1 , vi ( bb + 1 ) ) ;

    const pii init = { -1 , -1 } ;
    vector < vpii > parent ( aa + 1 , vpii ( bb + 1 , init ) ) ;

    for ( int i = 0 ; i < aa ; i ++ )
    {
        for ( int j = 0 ; j < bb ; j ++ )
        {
            if ( a[i] == b[j] )
            {
                dp[i + 1][j + 1] = 1 + dp[i][j] ;
                parent[i + 1][j + 1] = { i , j } ;
            }

            else if ( dp[i][j + 1] > dp[i + 1][j] )
            {
                dp[i + 1][j + 1] = dp[i][j + 1] ;
                parent[i + 1][j + 1] = { i , j + 1 } ;
            }

            else
            {
                dp[i + 1][j + 1] = dp[i + 1][j] ;
                parent[i + 1][j + 1] = { i + 1 , j } ;
            }
        }
    }

    int max_len = 0 ;
    pii node = init ;

    for ( int i = 1 ; i < aa + 1 ; i ++ )
    {
        for ( int j = 1 ; j < bb + 1 ; j ++ )
        {
            if ( dp[i][j] > max_len )
            {
                max_len = dp[i][j] ;
                node = { i , j } ;
            }
        }
    }

    string ans = "" ;

    while ( node != init )
    {
        int x = node.F , y = node.S ;

        int xx = parent[x][y].F ;
        int yy = parent[x][y].S ;

        if ( xx + 1 == x && yy + 1 == y && xx >=0 )
        {
            ans += a[xx] ;
        }

        node = parent[x][y] ;
    }

    reverse ( all ( ans ) ) ;
    cout << ans ;

    line ;
}

int main()
{fast
    int t = 1;
    // cin >> t;

    for ( int i=1 ; i <= t ; i ++ ) solve ( i ) ;
    return 0;
}


Measured memory_bytes: 105984