#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
ll N, K;
vll p, q;


vll op(vll x, vll y) {
	vll ret(N + 1);
	repn(i, N) { ret[x[i]] = y[i]; }
	return ret;
}

vll con(vll y,vll x) {
	vll ret(N + 1);
	repn(i, N)ret[i] = y[x[i]];
	return ret;
}

vll inv(vll x) {
	vll ret(N + 1);
	repn(i, N)ret[x[i]] = i;
	return ret;
}

vll ini;

vll db(vll x, ll K) {
	if (K == 0) {
		return ini;
	}

	
	vll c = db(x, K / 2);
	vll ret = con(c, con(c, ini));
	if (K % 2 == 1) { ret = con(x, ret); }
	return ret;
}


int main() {
	cin >> N >> K;
	p.resize(N + 1);
	q.resize(N + 1);

	repn(i, N)cin >> p[i];
	repn(i, N) cin >> q[i];

	ini.assign(N + 1, 0);
	repn(i, N) ini[i] = i;

	if (K == 1) {
		repn(i, N)cout << p[i] << " ";
		cout << endl;
		return 0;
	}

	vll pqpq = con(inv(p), con(q, con(p, inv(q))));

	vll ans(N + 1);
	repn(i, N) ans[i] = i;

	vvll a(12);
	a[1] = p;
	a[2] = q;
	repn(i, 9)a[i + 2] = op(a[i], a[i + 1]);

	//repn(i, 9) {
	//	repn(j, N)cout << a[i][j] << " ";
	//	cout << endl;
	//}

	ll x = (K - 2) % 6 + 2;
	ll L = (K + 4) / 6 - 1;

	//repn(i, N)cout << db(pqpq,1)[i] << " ";
	//cout << endl;

	ans = con(db(pqpq, L), ans);
	//ans = con(pqpq, ans);
	ans = con(a[x], ans);
	//ans = con(inv(pqpq), ans);
	ans = con(db(inv(pqpq), L), ans);

	repn(i, N)cout << ans[i] << " ";
	cout << endl;


}

Measured memory_bytes: 42708