#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int ndel[1010][1010];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n), b(m);
  rep(i, n) cin >> a[i];
  rep(i, m) cin >> b[i];
  rep(i, n) ndel[i][m] = n;
  rep(j, m) ndel[n][j] = n;
  rrep(i, n) {
    rep(j, m) {
      if (a[i] != b[j]) {
        ndel[i][j] = ndel[i+1][j];
      } else if (ndel[i+1][j] == n) {
        if (j+1 == m || ndel[i+1][j+1] != n) ndel[i][j] = i;
        else ndel[i][j] = n;
      } else {
        ndel[i][j] = ndel[i+1][j];
        int i1 = i, j1 = j;
        int i2 = i+1, j2 = j+1;
        bool upd = false;
        rrep(_, n - i - (m - j)) {
          while (i1 == ndel[i1][j1]) i1++, j1++;
          while (i2 == ndel[i2][j2]) i2++, j2++;
          if (a[i1] != a[i2]) {
            upd = a[i1] > a[i2];
            break;
          }
          i1++, i2++;
        }
        if (upd) ndel[i][j] = i;
      }
    }
  }
  int i = 0, j = 0;
  rrep(_, n - m) {
    while (i == ndel[i][j]) i++, j++;
    cout << a[i] << " \n"[_ == 0];
    i++;
  }
}