#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

// char tog(char c) {
//   if (isupper(c)) return c-'A'+'a';
//   return c-'a'+'A';
// }
// string rev(string s) {
//   reverse(rng(s));
//   for (char& c : s) c = tog(c);
//   return s;
// }

// int main() {
//   int n;
//   scanf("%d",&n);
//   string a = "A";
//   string b = "B";
//   rep(i,n) {
//     string c = b;
//     while (sz(a) && sz(c)) {
//       if (a.back() != c.back()) break;
//       a.pop_back();
//       c.pop_back();
//     }
//     c += rev(a);
//     cerr<<c<<endl;
//     a = b; b = c;
//   }
//   return 0;
// }

vi input(int n) {
  vi a(n);
  cin>>a;
  rep(i,n) a[i]--;
  return a;
}
vi inv(vi a) {
  vi res(sz(a));
  rep(i,sz(a)) {
    res[a[i]] = i;
  }
  return res;
}
vi f(vi a, vi b) {
  int n = sz(a);
  vi res(n);
  rep(i,n) res[i] = b[a[i]];
  return res;
}
void out(vi a) {
  rep(i,sz(a)) a[i]++;
  cout<<a<<endl;
}

vi I;
vi ex(vi a, int t) {
  if (!t) return I;
  vi res = ex(a,t>>1);
  res = f(res,res);
  if (t&1) res = f(res,a);
  return res;
}

int main () {
  int n,t;
  scanf("%d%d",&n,&t);
  vi a = input(n);
  vi b = input(n);
  vi A = inv(a);
  vi B = inv(b);
  I = vi(n);
  rep(i,n) I[i] = i;

  if (t == 1) {
    out(a);
    return 0;
  }
  // if (t == 2) {
  //   out(b);
  //   return 0;
  // }
  // if (t == 3) {
  //   out(f(A,b));
  //   return 0;
  // }

  vi BabA = f(f(f(B,a),b),A);
  vi aBAb = inv(BabA);

  t -= 2;
  int c = t/6;
  t %= 6;

  vi l = ex(BabA,c+t/3);
  vi r = ex(aBAb,c);

  vi ans = I;
  ans = f(ans,l);
  if (t < 3) {
    ans = f(ans,B);
    if (t >= 1) ans = f(ans,a);
    if (t >= 2) ans = f(ans,b);
  } else {
    if (t >= 5) ans = f(ans,B);
    if (t >= 4) ans = f(ans,A);
    ans = f(ans,b);
  }
  ans = f(ans,r);

  out(inv(ans));
  return 0;
}



















Measured memory_bytes: 15572