//thatsramen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)

using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;

//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;

//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> bool mins(T& x, T y) { if (x > y) { x = y; return true; } return false; }
template<typename T> bool maxs(T& x, T y) { if (x < y) { x = y; return true; } return false; }
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

//order_of_key(k): number of elements strictly less than k
//find_by_order(k): k-th element in the set

void setPrec() {cout << fixed << setprecision(15);}
void unsyncIO() {cin.tie(0)->sync_with_stdio(0);}
void setIn(string s) {freopen(s.c_str(), "r", stdin);}
void setOut(string s) {freopen(s.c_str(), "w", stdout);}
void setIO(string s = "") {
    unsyncIO(); setPrec();
    if(s.size()) setIn(s + ".in"), setOut(s + ".out");
}

// #define TEST_CASES

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
        b[i]--;
    }
    vector<vector<int>> cost(m + 1, vector<int> (m + 1, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int d = 0;
            if (a[i] == b[i]) {
                d++;
            }
            if (j == b[i]) {
                d--;
            }
            cost[a[i] + 1][j + 1] += d;
        }
    }
    auto get = [&]() -> int {
        vector<int> u (m+1), v (m+1), p (m+1), way (m+1);
        for (int i=1; i<=m; ++i) {
            p[0] = i;
            int j0 = 0;
            vector<int> minv (m+1, IINF);
            vector<char> used (m+1, false);
            do {
                used[j0] = true;
                int i0 = p[j0],  delta = IINF,  j1;
                for (int j=1; j<=m; ++j)
                    if (!used[j]) {
                        int cur = cost[i0][j]-u[i0]-v[j];
                        if (cur < minv[j])
                            minv[j] = cur,  way[j] = j0;
                        if (minv[j] < delta)
                            delta = minv[j],  j1 = j;
                    }
                for (int j=0; j<=m; ++j)
                    if (used[j])
                        u[p[j]] += delta,  v[j] -= delta;
                    else
                        minv[j] -= delta;
                j0 = j1;
            } while (p[j0] != 0);
            do {
                int j1 = way[j0];
                p[j0] = p[j1];
                j0 = j1;
            } while (j0);
        }
        return -v[0];
    };
    vector<int> to(m + 1, -1);
    vector<bool> used(m + 1, false);
    for (int i = 0; i < n; i++) {
        if (to[a[i] + 1] != -1) {
            cout << to[a[i] + 1] << ' ';
            continue;
        }
        vector<int> prev = cost[a[i] + 1];
        for (int j = 1; j <= m; j++) {
            cost[a[i] + 1][j] = IINF;
        }
        int can = -1, mn = IINF;
        for (int j = m; j >= 1; j--) {
            if (!used[j]) {
                cost[a[i] + 1][j] = prev[j];
                int cur = get();
                if (cur <= mn) {
                    can = j;
                    mn = cur;
                }
                cost[a[i] + 1][j] = IINF;
            }
        }
        cost[a[i] + 1][can] = prev[can];
        used[can] = true;
        to[a[i] + 1] = can;
        cout << can << ' ';
    }
}

int main() {
    setIO();

    int tt = 1;
    #ifdef TEST_CASES
        cin >> tt;
    #endif

    while (tt--)
        solve();

    return 0;
}