#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

vector<LL> func(vector<LL> a, vector<LL> b) {
  vector<LL> ret(a.size());
  for (int i = 0; i < a.size(); i++) ret[a[i]] = b[i];
  return ret;
}

vector<LL> inv(vector<LL> a) {
  vector<LL> ret(a.size());
  for (int i = 0; i < a.size(); i++) ret[a[i]] = i;
  return ret;
}

vector<LL> mult(vector<LL> a, vector<LL> b) {
  vector<LL> ret(a.size());
  for (int i = 0; i < a.size(); i++) ret[i] = a[b[i]];
  return ret;
}

vector<LL> pow(vector<LL> a, int k) {
  if (k == 0) {
    vector<LL> ret(a.size());
    for (int i = 0; i < a.size(); i++) ret[i] = i;
    return ret;
  }
  if (k == 1) return a;
  vector<LL> ret = pow(a, k / 2);
  ret = mult(ret, ret);
  if (k % 2 == 1) {
    ret = mult(ret, a);
  }
  return ret;
}

void check(vector<LL> p, vector<LL> q, int K) {
  K--;
  vector<vector<LL>> data;
  data.push_back(p);
  data.push_back(q);
  for (int i = 2; i <= 20; i++) {
    data.push_back(func(data[i - 2], data[i - 1]));
  }

  auto tmp = mult(data[9], data[6]);
  auto tmpinv = inv(tmp);
  auto base = data[K % 6];
  base = mult(base, pow(tmpinv, K / 6));
  base = mult(pow(tmp, K / 6), base);
  for (int i = 0; i < base.size(); i++) {
    cout << base[i] + 1;
    if (i < base.size() - 1)
      cout << " ";
    else
      cout << endl;
  }
}

void solve(long long N, long long K, std::vector<long long> p,
           std::vector<long long> q) {
  for (auto&& i : p) i--;
  for (auto&& i : q) i--;

  check(p, q, K);
}

int main() {
  cout << setprecision(10);
  long long N;
  scanf("%lld", &N);
  long long K;
  scanf("%lld", &K);
  std::vector<long long> p(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &p[i]);
  }
  std::vector<long long> q(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &q[i]);
  }
  solve(N, K, std::move(p), std::move(q));
  return 0;
}


Measured memory_bytes: 46004