#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

int p[MAX_N], q[MAX_N], tmp[MAX_N], block[MAX_N], ad[MAX_N];
int pinv[MAX_N], qinv[MAX_N];
int x[MAX_N], y[MAX_N], z[MAX_N];
int xinv[MAX_N], yinv[MAX_N], zinv[MAX_N];
int res[MAX_N], resinv[MAX_N];
int n, K;

void unite(int *a, int *b, int *c){
	rep(i,n){
		c[i] = a[b[i]];
	}
}

void pow(int *a, int cnt, int *b){
	rep(i,n) b[i] = i;
	while(cnt){
		if(cnt % 2){
			unite(b, a, tmp);
			rep(i,n) b[i] = tmp[i];
		}
		unite(a, a, tmp);
		rep(i,n) a[i] = tmp[i];
		cnt >>= 1;
	}
}

void print(int *a){
	rep(i,n){
		cout << a[i]+1 << " ";
	}
	cout << "\n";
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> K;
	rep(i,n){
		cin >> p[i];
		--p[i];
	}
	rep(i,n){
		cin >> q[i];
		--q[i];
	}
	rep(i,n){
		pinv[p[i]] = i;
		qinv[q[i]] = i;
	}
	unite(qinv, p, block);
	rep(i,n) ad[i] = tmp[i] = block[i];
	unite(pinv, tmp, block);
	rep(i,n) tmp[i] = block[i];
	unite(q, tmp, block);
	rep(i,n){
		x[i] = q[i], xinv[i] = qinv[i];
	}
	unite(q, pinv, y), unite(qinv, p, yinv);
	unite(y, qinv, z), unite(yinv, q, zinv);
	if(K == 1){
		print(p);
	}else{
		pow(block, (K-2)/6, res);
		if((K-2) % 6 >= 3){
			unite(res, y, tmp);
			rep(i,n) res[i] = tmp[i];
			rep(i,n) resinv[res[i]] = i;
			if((K-2) % 6 == 3){
				unite(res, xinv, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}else if((K-2) % 6 == 4){
				unite(res, yinv, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}else{
				unite(res, zinv, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}
		}else{
			rep(i,n) resinv[res[i]] = i;
			if((K-2) % 6 == 0){
				unite(res, x, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}else if((K-2) % 6 == 1){
				unite(res, y, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}else{
				unite(res, z, tmp);
				rep(i,n) res[i] = tmp[i];
				unite(res, resinv, tmp);
			}
		}
		print(tmp);
	}
    return 0;
}


Measured memory_bytes: 6656