#include <bits/stdc++.h>

using namespace std;

const int N_ = 1e5 + 5;

int n, m, a[N_], b[N_], p[65], cnt[65][65], ord[65], vis[65], top = 0;

inline int read() {
	register int s = 0, f = 1; register char ch = getchar();
	while (!isdigit(ch)) f = (ch == '-' ? -1 : 1), ch = getchar();
	while (isdigit(ch)) s = (s * 10) + (ch & 15), ch = getchar();
	return s * f;
}

template <int N> class MinCost {
	private :
		struct Edge {
			int from, to, flow, dis;
			inline Edge(int n, int m, int s, int l) : from(n), to(m), flow(s), dis(l) {}
		};

		int s, t, pre[N], dis[N], last[N], flow[N], en;
		bool vis[N];
		vector<Edge> ed;
		vector<int> e[N];
		
		inline bool spfa() {
			memset(vis, 0, sizeof vis);
			memset(dis, 0xcf, sizeof dis);
			pre[t] = -1;
			memset(flow, 0x3f, sizeof flow);
			dis[s] = 0;
			vis[s] = 1;
			queue<int> q;
			q.push(s);
			while (!q.empty()) {
				int x = q.front();
				q.pop();
				vis[x] = 0;
				for (vector<int> :: iterator it = e[x].begin(); it != e[x].end(); ++it) {
					int v = ed[(*it)].to, fl = ed[(*it)].flow, d = ed[(*it)].dis;
					if (fl > 0 && dis[v] < dis[x] + d) {
						dis[v] = dis[x] + d;
						flow[v] = min(flow[x], fl);
						pre[v] = x;
						last[v] = (*it);
						if (!vis[v]) {
							vis[v] = 1;
							q.push(v);
						}
					}
				}
			}
			return pre[t] != -1;
		}
		
	public :
		int mc, mf;
		
		MinCost() { en = -1; }
		
		~MinCost() {}
		
		inline void addedge(int from, int to, int flow, int dis) {
			ed.push_back(Edge(from, to, flow, dis));
			e[from].push_back(++en);
			ed.push_back(Edge(to, from, 0, -dis));
			e[to].push_back(++en);
		}

		inline void MCMF(int __s, int __t) {
			s = __s; t = __t;
			mc = mf = 0;
			while (spfa()) {
				int now = t;
				mf += flow[t];
				mc += dis[t] * flow[t];
				while (now != s) {
					ed[last[now]].flow -= flow[t];
					ed[last[now] ^ 1].flow += flow[t];
					now = pre[now];
				}
			}
		}
		
		inline void clear() {
			ed.clear();
			for (int i = 0; i < N; ++i) e[i].clear();
		}
};

bool visl[65], visr[65];

inline int calc() {
	MinCost<123> T;
	int s = 2 * m + 1, t = 2 * m + 2;
	memset(visl, 0, sizeof visl); memset(visr, 0, sizeof visr);
	int res = 0;
	for (int i = 1; i <= m; ++i) 
		if (p[i]) {
			visl[i] = 1; visr[p[i]] = 1;
			res += cnt[i][p[i]];
		}
	for (int i = 1; i <= m; ++i) {
		if (!visl[i]) T.addedge(s, i, 1, 0);
		if (!visr[i]) T.addedge(i + m, t, 1, 0);
	}
	for (int i = 1; i <= m; ++i)
		if (!visl[i])
			for (int j = 1; j <= m; ++j)
				if (!visr[j])
					T.addedge(i, j + m, 1, cnt[i][j]);
	T.MCMF(s, t);
//	cerr << T.mf << endl;
	res += T.mc; T.clear(); 
	return res;
}

int main() {
//	freopen("C.in", "r", stdin);
	n = read(); m = read();
	for (int i = 1; i <= n; ++i) a[i] = read();
	for (int i = 1; i <= n; ++i)
		if (!vis[a[i]]) ord[++top] = a[i], vis[a[i]] = 1;
	for (int i = 1; i <= m; ++i)
		if (!vis[i]) ord[++top] = i, vis[i] = 1;
	for (int i = 1; i <= n; ++i) b[i] = read(), ++cnt[a[i]][b[i]];
	int ans = calc(); memset(vis, 0, sizeof vis);
	for (int i = 1; i <= m; ++i) {
		int x = ord[i];
		for (int j = 1; j <= m; ++j)
			if (!vis[j]) {
				p[x] = j;
//				cerr << ans << ' ' << calc() << endl;
				if (calc() == ans) {
					vis[j] = 1;
					break;
				} else p[x] = 0;
			}
	}
	for (int i = 1; i <= n; ++i) printf("%d ", p[a[i]]);
	return 0;
}