//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 500005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n;
int s[N];
int p[N], q[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    s[0] = minf;
    s[n+1] = inf;
    for(int i=1; i<=n; i++) cin >> s[i];
    for(int i=1; i<=n; i++) cin >> p[i];
    for(int i=1; i<=n; i++) cin >> q[i];
}

int rig[N][20];
int lef[N][20];

void proc()
{
    stack<int> st;
    for(int i=0; i<=1+n; i++){
        while (st.size() && s[st.top()]<s[i]){
            rig[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    rig[0][0] = 1;
    rig[n][0] = n+1;
    rig[n+1][0] = n+1;
    while (st.size()) st.pop();
    for(int i=n+1; i>=0; i--){
        while (st.size() && s[st.top()]>s[i]){
            lef[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    lef[n+1][0] = n;
    lef[1][0] = 0;
    lef[0][0] = 0;
    for(int j=1; j<20; j++){
        for(int i=0; i<=n+1; i++){
            rig[i][j] = rig[rig[i][j-1]][j-1];
            lef[i][j] = lef[lef[i][j-1]][j-1];
        }
    }
    for(int i=1; i<=n; i++){
        int l = q[i];
        int r = p[i];
        int cur1=i;
        for(int j=19; j>=0; j--){
            if (bit(r,j)) cur1 = rig[cur1][j];
        }
        for(int j=19; j>=0; j--){
            if (bit(l,j)) cur1 = lef[cur1][j];
        }
        int s1 = s[cur1];
        int cur2 = i;
        for(int j=19; j>=0; j--){
            if (bit(l,j)) cur2 = lef[cur2][j];
        }
        for(int j=19; j>=0; j--){
            //if (bit(r,j)) cout << j << ' ';
            if (bit(r,j)) cur2 = rig[cur2][j];
        }
        int s2 = s[cur2];
        if (s1 >= s2) cout << cur1 << ' ';
        else cout << cur2 << ' ';
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}