#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-9;
const double INFD = numeric_limits<double>::infinity();
const double PI = 3.14159265358979323846;
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loopll(i, n) for(ll i = 0; i < (ll)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopll1(i, n) for(ll i = 1; i <= (ll)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = (ll)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
#define Looprll1(i, n) for(ll i = (ll)n; i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
bool nearlyeq(double x, double y) { return abs(x - y) < eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vi xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

/*******************************************************/

vi rev_map(const vi &f) {
	int n = f.size();
	vi ret(n);
	Loop(i, n) {
		ret[f[i]] = i;
	}
	return ret;
}

// g, then, f
vi seq_map(const vi &f, const vi &g) {
	int n = f.size();
	vi ret(n);
	Loop(i, n) {
		ret[i] = f[g[i]];
	}
	return ret;
}

vi pow_map(const vi &f, int p) {
	vi ret;
	if (p == 0) {
		ret.resize(f.size());
		Loop(i, f.size()) ret[i] = i;
	}
	else if (p == 1) ret = f;
	else {
		ret = pow_map(f, p / 2);
		ret = seq_map(ret, ret);
		if (p % 2 == 1) ret = seq_map(f, ret);
	}
	return ret;
}

int main() {
	int n, k; cin >> n >> k; k--;
	vi p(n);
	Loop(i, n) {
		cin >> p[i]; p[i]--;
	}
	vi q(n);
	Loop(i, n) {
		cin >> q[i]; q[i]--;
	}
	vi P = rev_map(p);
	vi Q = rev_map(q);
	vi qPQp = seq_map(q, seq_map(P, seq_map(Q, p)));
	vi PqpQ = rev_map(qPQp);
	vi qP = seq_map(q, P);
	vi qPQ = seq_map(qP, Q);
	vi qPQpQ = seq_map(qPQ, seq_map(p, Q));
	vi qPQppQ = seq_map(qPQ, seq_map(p, seq_map(p, Q)));
	vi qPQpqpQ = seq_map(qPQ, seq_map(p, seq_map(q, seq_map(p, Q))));
	vi ans;
	if (k == 0) {
		ans = p;
	}
	else {
		k--;
		int m = k / 6;
		if (k % 6 == 0) {
			ans = seq_map(pow_map(qPQp, m), seq_map(q, pow_map(PqpQ, m)));
		}
		else if (k % 6 == 1) {
			ans = seq_map(pow_map(qPQp, m), seq_map(qP, pow_map(PqpQ, m)));
		}
		else if (k % 6 == 2) {
			ans = seq_map(pow_map(qPQp, m), seq_map(qPQ, pow_map(PqpQ, m)));
		}
		else if (k % 6 == 3) {
			ans = seq_map(pow_map(qPQp, m), seq_map(qPQpQ, pow_map(PqpQ, m)));
		}
		else if (k % 6 == 4) {
			ans = seq_map(pow_map(qPQp, m), seq_map(qPQppQ, pow_map(PqpQ, m)));
		}
		else if (k % 6 == 5) {
			ans = seq_map(pow_map(qPQp, m), seq_map(qPQpqpQ, pow_map(PqpQ, m)));
		}
	}
	Loop(i, n) ans[i]++;
	printv(ans);
}

/*

p
q
qP
qPQ
qPQpQ
qPQppQ
qPQpqpQ
qPQp q PqpQ
qPQp qP PqpQ
qPQp qPQ PqpQ
qPQp qPQpQ PqpQ
qPQp qPQppQ PqpQ
qPQp qPQpqpQ PqpQ
qPQpqPQp q PqpQPqpQ
qPQpqPQp qP PqpQPqpQ
qPQpqPQp qPQ PqpQPqpQ
qPQpqPQp qPQpQ PqpQPqpQ
qPQpqPQp qPQppQ PqpQPqpQ
qPQpqPQp qPQpqpQ PqpQPqpQ
qPQpqPQpqPQp q PqpQPqpQPqpQ
qPQpqPQpqPQp qP PqpQPqpQPqpQ
qPQpqPQpqPQp qPQ PqpQPqpQPqpQ
qPQpqPQpqPQp qPQpQ PqpQPqpQPqpQ
qPQpqPQpqPQp qPQppQ PqpQPqpQPqpQ
qPQpqPQpqPQp qPQpqpQ PqpQPqpQPqpQ

*/

Measured memory_bytes: 6640