#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
//#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

void out_ans(vec ans){
    for(int x: ans) cout << x + 1 << " ";
    cout << endl;
}

vec func(vec p, vec q){
    int N = SZ(p);
    vec r(N);
    REP(i, N) r[p[i]] = q[i];
    return r;
}

vec mul(vec p, vec q){
    int N = SZ(p);
    vec r(N);
    REP(i, N) r[i] = p[q[i]];
    return r;
}

vec pow(vec a, int n){
    vec p(SZ(a)); REP(i, SZ(a)) p[i] = i;
    IREP(i, 31){
        p = mul(p, p);
        if((n >> i) & 1) p = mul(p, a);
    }
    return p;
}

signed main(){

    int N, K; cin >> N >> K;
    vec p(N); cin >> p;
    vec q(N); cin >> q;
    REP(i, N){
        p[i]--; q[i]--;
    }

    if(K <= 6){
        mat a(6);
        a[0] = p; a[1] = q;
        FOR(i, 2, 6) a[i] = func(a[i - 2], a[i - 1]);
        out_ans(a[K - 1]);
        return 0;
    }

    vec P(N), Q(N);
    REP(i, N){
        P[p[i]] = i;
        Q[q[i]] = i;
    }

    vec PQpq = mul(P, mul(Q, mul(p, q)));
    vec QPqp = mul(Q, mul(P, mul(q, p)));
    vec mid;
    if(K % 6 == 1) mid = p;
    else if(K % 6 == 2) mid = mul(P, mul(q, p));
    else if(K % 6 == 3) mid = mul(P, mul(P, mul(q, p)));
    else if(K % 6 == 4) mid = mul(P, QPqp);
    else if(K % 6 == 5) mid = mul(P, mul(Q, mul(p, QPqp)));
    else if(K % 6 == 0) mid = mul(P, mul(Q, mul(p, mul(p, QPqp))));

    int n = (K - 1) / 6;
    vec ans = mul(q, mul(pow(PQpq, n), mul(mid, mul(pow(QPqp, n - 1), Q))));
    out_ans(ans);

    return 0;
}


Measured memory_bytes: 7888