#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 1e6 + 10;
const int M = 3e5 + 10;

int A[M], B[M], mx[M], mn[M], pos[M], ans[N];
vector <pair <int, int>> ask[M], add[M];

struct seg{
    vector <int> seg;
    void ass(int n) {
        seg.assign(n * 4 + 100, 0);
    }

    void upd(int id, int l, int r, int p, int v) {
        seg[id] = max(seg[id], v);
        if (l == r)
            return;

        int m = (l + r) / 2;
        if (m >= p) {
            upd(id * 2, l, m, p, v);
        } else {
            upd(id * 2 + 1, m + 1, r, p, v);
        }
    }

    int get(int id, int l, int r, int u, int v) {
        if (l > v || r < u)
            return 0;

        if (l >= u && r <= v)
            return seg[id];

        int m = (l + r) / 2;
        return max(get(id * 2, l, m, u, v), get(id * 2 + 1, m + 1, r, u, v));
    }
};

int find_mex(int n, int x, int y) {
    int l = 0, r = n - 1, ans = -1;
    while (l <= r) {
        int m = (l + r) / 2;
        if (mn[m] >= x && mx[m] <= y) {
            ans = m;
            l = m + 1;
        } else {
            r = m - 1;
        }
    }

    return ans + 1;
}

void cal(int n) {
    seg seg;
    seg.ass(n);
    for (int i = 1; i <= n; i++) {
        mx[B[i]] = mn[B[i]] = i;
        pos[A[i]] = i;
    }

    for (int i = 1; i < n; i++) {
        mx[i] = max(mx[i - 1], mx[i]);
        mn[i] = min(mn[i - 1], mn[i]);
    }

    int l = n, r = 1;
    for (int i = 0; i < n; i++) {
        l = min(l, pos[i]);
        r = max(r, pos[i]);
        add[r].pb({l, i + 1 - find_mex(n, l, r)});
    }

    for (int i = 1; i <= n; i++) {
        for (auto x : add[i]) {
            seg.upd(1, 1, n, x.f, x.s);
        }

        for (auto x : ask[i]) {
            ans[x.s] = max(seg.get(1, 1, n, x.f, i), ans[x.s]);
        }

        add[i].clear();
    }
}

void solve() {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> A[i];

    for (int i = 1; i <= n; i++)
        cin >> B[i];

    int q;
    cin >> q;

    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        ask[r].pb({l, i});
    }

    cal(n);
    for (int i = 1; i <= n; i++) {
        swap(A[i], B[i]);
    }

    cal(n);
    for (int i = 1; i <= n; i++)
        ask[i].clear();

    for (int i = 1; i <= q; i++) {
        cout << ans[i] << "\n";
        ans[i] = 0;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

// ab a