#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a)-1; i >= (b); i--)
#define fore(e, v) for(auto&& e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template<typename T, typename S> bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; }
template<typename T, typename S> bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

template<typename T> vi z_algorithm(const vector<T>& s) {
   int n = si(s), l = -1, r = -1;
   vi z(n, n);
   rep(i, 1, n) {
      int& x = z[i] = i < r ? min<ll>(r - i, z[i - l]) : 0;
      while(i + x < n and s[i + x] == s[x]) x++;
      if(i + x > r) l = i, r = i + x;
   }
   return z;
}

int main() { 
    cin.tie(0)->sync_with_stdio(0); 

    ll n,m;
    cin >> n >> m;
    vl s(n),t(m);
    rep(i,n){
        cin >> s[i];
    }
    rep(i,m){
        cin >> t[i];
    }
    vector<vi> w(n);
    rep(i,n){
        vl temp;
        rep(j,i,n){
            temp.push_back(s[j]);
        }
        temp.push_back(-1);
        rep(j,m){
            temp.push_back(t[j]);
        }
        w[i] = z_algorithm(temp);
    }
    auto f = [&](ll i,ll j,ll k){
        if(k == 0){
            return true;
        }
        if(i == n){
            if(j == m){
                return true;
            }
            else{
                return false;
            }
        }
        if(w[i][n-i+1+j] >= k){
            return true;
        }
        else{
            return false;
        }
    };

    vl check(n+1,m);
    per(i,n,0){
        check[i] = check[i+1];
        if(check[i] > 0 && s[i] == t[check[i]-1]){
            check[i]--;
        }
    }

    map<ll,vl> mp;

    auto comp = [&](vl x,vl y){
        for(ll z:y){
            if(z == (1LL<<60)){
                return 1;
            }
        }
        rep(i,min(x.size(), y.size())){
            if(x[i] < y[i]){
                return 1;
            }
            else if(x[i] > y[i]){
                return -1;
            }
        }
        return 0;
    };
    /*
    cerr << "check" << endl;
    for(ll x:check){
        cerr << x << ' ';
    }
    cerr << endl;
    */

    auto calc = [&](auto calc,ll idx,ll jdx) -> vl {
        //cerr << idx << ' ' << jdx << endl;
        if(idx >= n){
            if(jdx >= m)return {};
            else return {1LL<<60};
        }
        
        if(mp.count(idx * (n+1) + jdx) == 1){
            return mp[idx * (n+1) + jdx];
        }
        ll length = 0;
        vl temp = {1LL<<60};
        rep(i,idx,n+1){
            //cerr << idx << ' ' << jdx << ' ' << i << ' ' << f(idx,jdx,length) << ' ' << (check[i] <= jdx+i) << endl;
            if(f(idx,jdx,length) == true && check[i] <= jdx+i && jdx+length <= m){
                if(i+1 >= n && jdx+length < m){
                    length++;
                    continue;
                }
                vl to = calc(calc,i+1,jdx+length);
                if(i < n)to.insert(to.begin(),s[i]);
                /*
                for(ll z:to){
                    cerr << z << ' ';
                }
                cerr << endl;
                */
                if(comp(temp,to) != 1){
                    swap(temp,to);
                }
            }
            length++;
        }
        mp[idx * (n+1) + jdx] = temp;

        
        /*
        cerr <<'!'<< idx << ' ' << jdx << ' ';
        for(ll x:temp){
            cerr << x << ' ';
        }
        cerr << endl;
        */
        
        
        return temp;
    };

    auto ans = calc(calc,0,0);
    for(ll x:ans){
        cout << x << ' ';
    }
    cout << endl;
    

    
}