#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
 
struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}

template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
    is>>p.first>>p.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


//ret[i][j] : i以降の文字jが登場する最初のindex
vector<vector<int>> fillnxt(string s){
    int n=(int)s.size();
    vector<vector<int>> ret(n+1,vector<int>(26,INF));
    for(int i=n-1;i>=0;i--){
        rep(j,26) ret[i][j]=ret[i+1][j];
        ret[i][s[i]-'a']=i;
    }
    return ret;
}

signed main(){
    
    string s,t;cin>>s>>t;
    int n=(int)s.size(),m=(int)t.size();

    auto ns=fillnxt(s);
    auto nt=fillnxt(t);
    // s[i~n)をt[j~m)で作れる
    // v[i]=j, 作れないなら-1
    vector<int> v(n+1,-1);
    v[n]=m;
    for(int i=n-1,j=m-1;i>=0;i--){
        while(j>=0 and s[i]!=t[j]) j--;
        v[i]=j;
        if(j!=-1)j--;
    }


    if(v[0]>=0){
        cout<<-1<<endl;
        return 0;
    }

    string res="";
    for(int i=0,j=0;i<n;){
        rep(k,26){
            int nj=nt[j][k],ni=ns[i][k];
            if(ni==INF){
                continue;
            }
            if(nj==INF){
                cout<<res<<char('a'+k)<<endl;
                return 0;
            }

            if(v[ni]>=nj)continue;
            res.push_back('a'+k);
            i=ni+1,j=nj+1;
            break;
        }
    }

    cout<<-1<<endl;
    return 0;
}