#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = -1;
int N;

vector<int> mul(const vector<int>& A, const vector<int>& B) {
    vector<int> C(N+1);
    for (int i = 1; i <= N; i++) C[i] = A[B[i]];
    return C;
}

vector<int> fast_pow(const vector<int>& A, int e) {
    if (e == 0) {
        vector<int> res(N+1);
        for (int i = 1; i <= N; i++) res[i] = i;
        return res;
    }
    if (e%2 == 0) return fast_pow(mul(A, A), e/2);
    return mul(A, fast_pow(mul(A, A), e/2));
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    // vector<string> vec = {"A", "X"};
    // for (int i = 0; i < 50; i++) {
    //     string s = vec[i+1];
    //     string t = vec[i];
    //     reverse(t.begin(), t.end());
    //     int it = 0;
    //     for (char c : t) {
    //         if (c != s.back()) break;
    //         it++;
    //         s.pop_back();
    //     }
    //     for (int j = it; j < SZ(t); j++) {
    //         if (t[j] == 'A') s += 'B';
    //         if (t[j] == 'B') s += 'A';
    //         if (t[j] == 'X') s += 'Y';
    //         if (t[j] == 'Y') s += 'X';
    //     }
    //     vec.push_back(s);
    //     cout << i << ": " << SZ(s) << " " << s << endl;
    // }

    cin >> N;
    int K;
    cin >> K;
    vector<int> A(N+1), X(N+1), B(N+1), Y(N+1);
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        B[A[i]] = i;
    }
    for (int i = 1; i <= N; i++) {
        cin >> X[i];
        Y[X[i]] = i;
    }
    if (K == 1) {
        for (int i = 1; i <= N; i++) cout << A[i] << " ";
        return 0;
    }
    if (K == 2) {
        for (int i = 1; i <= N; i++) cout << X[i] << " ";
        return 0;
    }
    vector<int> bef = mul(mul(X, B), mul(Y, A));
    vector<int> aft = mul(mul(B, X), mul(A, Y));

    K -= 3;
    int c = K % 6;
    K /= 6;
    int kb = K, ka = K;
    vector<int> mid;
    if (c == 0) mid = mul(X, B);
    if (c == 1) mid = mul(mul(X, B), Y);
    if (c == 2) mid = Y;
    if (c == 3) mid = mul(A, Y);
    if (c == 4) mid = mul(mul(X, A), Y);
    if (c == 5) mid = X;

    if (c >= 2) kb++;
    if (c >= 5) ka++;

    // dbg(bef, kb, aft, ka);
    bef = fast_pow(bef, kb);
    aft = fast_pow(aft, ka);

    // return 0;
    vector<int> res = mul(mul(bef, mid), aft);
    for (int i = 1; i <= N; i++) cout << res[i] << " ";
}


Measured memory_bytes: 14396