#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

// 参考：
// https://awakia-n.hatenablog.com/entry/20100515/1273922367
// 今後参考にしたい：
// https://drive.google.com/file/d/15_gwYirAxwjbTMEq5MXaPEZAlzkbZfia/view
struct BigInt{
    vector<int> d;
    bool minus = false; 
    BigInt& normalize(){
        int i = (int)d.size() - 1;
        while(i>=0 and d[i] == 0)--i;
        d.resize(i+1);
        if((int)d.size() == 0) {
            d.emplace_back(0);
            minus = false;
        }
        return *this;
    }
    int size(){
        return d.size();
    }
    BigInt(ll _x = 0){
        if(_x < 0){
            minus = true;
            _x = -_x;
        }
        while(_x){
            d.emplace_back(_x%10);
            _x /= 10;
        }
        if(d.size() == 0){
            d.emplace_back(0);
        }
    }
    BigInt(string _x){
        for(char &c:_x){
            if(c == '-'){
                minus = true;
            }
            else{
                d.emplace_back(c-'0');
            }
        }
        reverse(d.begin(), d.end());
        normalize();
    }
    BigInt& operator = (const BigInt& x);
    BigInt& operator = (const ll& x);
    BigInt& operator = (const string& x);
    const bool operator < (const BigInt& x) const;
    const bool operator > (const BigInt& x) const;
    const bool operator <= (const BigInt& x) const;
    const bool operator >= (const BigInt& x) const;
    const bool operator != (const BigInt& x) const;
    const bool operator == (const BigInt& x) const;
    BigInt operator -() const;
    BigInt& operator += (const BigInt& x);
    BigInt& operator -= (const BigInt& x);
    BigInt& operator *= (const BigInt& x);
    const BigInt operator + (const BigInt& x) const;
    const BigInt operator - (const BigInt& x) const;
    const BigInt operator * (const BigInt& x) const;
    friend istream& operator >> (istream& is, BigInt& x);
    friend ostream& operator << (ostream& os, const BigInt& x);
    friend const BigInt abs(BigInt x);
};

BigInt& BigInt::operator = (const BigInt& x){
    minus = x.minus;
    d = x.d;
    return *this;
}

BigInt& BigInt::operator = (const ll& x){
    return *this = BigInt(x);
}

BigInt& BigInt::operator = (const string& x){
    return *this = BigInt(x);
}

const bool BigInt::operator < (const BigInt& x) const{
    if(minus != x.minus) return (minus ? true : false);
    if(d.size() != x.d.size()) return (d.size() < x.d.size()) ^ minus;
    for (int i = (int)d.size()-1; i >= 0; --i){
        if(d[i] != x.d[i]) return (d[i] < x.d[i]) ^ minus;
    }
    return false;
}

const bool BigInt::operator > (const BigInt& x) const{return x<(*this);}
const bool BigInt::operator <= (const BigInt& x) const{return !(x<(*this));}
const bool BigInt::operator >= (const BigInt& x) const{return !(x>(*this));}
const bool BigInt::operator != (const BigInt& x) const{return (*this)<x || x<(*this);}
const bool BigInt::operator == (const BigInt& x) const{return !((*this)<x || x<(*this));}

BigInt BigInt::operator -() const{
    BigInt res(*this);
    res.minus = !res.minus;
    return res;
}

BigInt& BigInt::operator += (const BigInt& x){
    if(minus != x.minus) return *this -= -x;
    if(d.size() < x.d.size()) d.resize(x.d.size());
    int tmp = 0;
    for (int i = 0; i < (int)d.size(); ++i) {
        d[i] += (i < (int)x.d.size() ? x.d[i] : 0) + tmp;
        if(d[i] >= 10){
            tmp = 1;
            d[i] -= 10;
        }
        else tmp = 0;
    }
    if(tmp) d.emplace_back(1);
    return *this;
}

BigInt& BigInt::operator -= (const BigInt& x){
    if(minus != x.minus) return *this += -x;
    vector<int> dd(x.d);
    if(((*this)<x) ^ minus){
        swap(d,dd);
        minus = !minus;
    }
    int tmp = 0;
    for (int i = 0; i < (int)d.size(); ++i) {
        d[i] -= (i < (int)dd.size() ? dd[i] : 0) + tmp;
        if(d[i] < 0){
            d[i] += 10;
            tmp = 1;
        }
        else{
            tmp = 0;
        }
    }
    return this->normalize();
}

BigInt& BigInt::operator *= (const BigInt& x){
    minus ^= x.minus;
    int N1 = (int)d.size();
    int N2 = (int)x.d.size();
    int N = N1 + N2;
    vector<int> dd(N);
    for (int i = 0; i < N1; ++i) {
        for (int j = 0; j < N2; ++j) {
            dd[i+j] += d[i] * x.d[j];
        }
    }
    for (int i = 0; i+1 < N; ++i) {
        dd[i+1] += dd[i] / 10;
        dd[i] %= 10;
    }
    swap(d,dd);
    return this->normalize();
}

const BigInt BigInt::operator + (const BigInt& x) const{
    BigInt res(*this); return res += x;
}
const BigInt BigInt::operator - (const BigInt& x) const{
    BigInt res(*this); return res -= x;
}
const BigInt BigInt::operator * (const BigInt& x) const{
    BigInt res(*this); return res *= x;
}

istream& operator >> (istream& is, BigInt& x){
    string s; is >> s;
    x = BigInt(s);
    return is;
}

ostream& operator << (ostream& os, const BigInt& x){
    if(x.minus) os << '-';
    int N = x.d.size();
    for (int i = N-1; i >= 0; --i){
        os << x.d[i];
    }
    return os;
}

const BigInt abs(BigInt x){
    x.minus = false;
    return x;
}

BigInt inf;

struct Primal_Dual{
    const BigInt INF=inf;
    struct edge{
        int to;
        BigInt cap,cost;
        int rev;
    };
    vector<vector<edge>> G;
    vector<BigInt> potential,min_cost;
    vector<int> prevv,preve;
    Primal_Dual(int V):G(V){}
    void add_edge(int s,int t,int cap,BigInt cost){
        G[s].push_back((edge){t,cap,cost,(int)(G[t].size())});
        G[t].push_back((edge){s,0,-cost,(int)(G[s].size()-1)});
    }
    BigInt min_cost_flow(int s,int t,BigInt f){
        int V=G.size(); BigInt res=0;
        priority_queue<pair<BigInt,int>,vector<pair<BigInt,int>>,greater<pair<BigInt,int>>> pq;
        potential.assign(V,0);
        preve.assign(V,-1);
        prevv.assign(V,-1);
        while(f>0){
            min_cost.assign(V,INF);
            pq.push(make_pair(0,s));
            min_cost[s]=0;
            while(pq.size()){
                auto p=pq.top(); pq.pop();
                if(min_cost[p.second]<p.first)continue;
                int i=-1;
                for(auto &e:G[p.second]){
                    i++;
                    BigInt nextcost=min_cost[p.second]+e.cost+potential[p.second]-potential[e.to];
                    if(e.cap>0 and min_cost[e.to]>nextcost){
                        min_cost[e.to]=nextcost;
                        prevv[e.to]=p.second;
                        preve[e.to]=i;
                        pq.push(make_pair(min_cost[e.to],e.to));
                    }
                }
            }
            if(min_cost[t]==INF)return -1; // 流せない
            for(int v=0;v<V;v++){
                potential[v]+=min_cost[v];
            }
            BigInt Addflow=f;
            for(int v=t;v!=s;v=prevv[v]){
                Addflow=min(Addflow,G[prevv[v]][preve[v]].cap);
            }
            f-=Addflow;
            res+=Addflow*potential[t];
            for(int v=t;v!=s;v=prevv[v]){
                edge &e=G[prevv[v]][preve[v]];
                e.cap-=Addflow;
                G[v][e.rev].cap+=Addflow;
            }
        }
        return res;
    }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    vector<BigInt> pow60(66);
    pow60[0] = 1;
    for(int i=1;i<66;i++){
        pow60[i] = pow60[i-1] * 60;
    }
    inf = pow60.back();
    int n; cin >> n;
    int m; cin >> m;
    vector<int> a(n),b(n);
    vector<vector<int>> g(m);
    for(int i=0;i<n;i++){
        cin >> a[i]; a[i]--;
        g[a[i]].push_back(i);
    }
    for(int i=0;i<n;i++){
        cin >> b[i]; b[i]--;
    }
    vector<int> pri(m,-1);
    int cur = 59;
    for(int i=0;i<n;i++){
        if(pri[a[i]] == -1){
            pri[a[i]] = cur;
            cur--;
        }
    }
    for(int i=0;i<m;i++){
        if(pri[i] == -1){
            pri[i] = cur;
            cur--;
        }
    }
    Primal_Dual G(2*m+2);
    int S = 2*m, T = 2*m+1;
    for(int i=0;i<m;i++){
        G.add_edge(S, i, 1, 0);
        G.add_edge(i+m, T, 1, 0);
    }
    for(int i=0;i<m;i++){
        int sum = g[i].size();
        vector<int> cnt(m);
        for(int j:g[i]){
            cnt[b[j]]++;
        }
        for(int j=0;j<m;j++){
            G.add_edge(i, j+m, 1, pow60[60]*(BigInt)(sum-cnt[j]) + pow60[pri[i]] * j);
        }
    }
    auto r = G.min_cost_flow(S, T, m);
    vector<int> exchange(m);
    for(int i=0;i<m;i++){
        for(auto e:G.G[i]){
            if(m <= e.to and e.to < S and e.cap == 0){
                exchange[i] = e.to - m;
            }
        }
    }
    for(int i=0;i<n;i++){
        if(i) cout << " ";
        cout << exchange[a[i]]+1;
    }
    cout << endl;
}