Two permutations

Description:

Input:

The first line contains one integer n (1 ≤ n ≤ 10⁶), the number of elements in both permutations. The following line contains n integers, separated with spaces: p₁, p₂, ..., p_n (1 ≤ p_i ≤ n). These are elements of the first permutation. The next line contains the second permutation q₁, q₂, ..., q_n in same format.

The following line contains an integer m (1 ≤ m ≤ 2·10⁵), that is the number of queries.

The following m lines contain descriptions of queries one in a line. The description of the i-th query consists of four integers: a, b, c, d (1 ≤ a, b, c, d ≤ n). Query parameters l₁, r₁, l₂, r₂ are obtained from the numbers a, b, c, d using the following algorithm:

1. Introduce variable x. If it is the first query, then the variable equals 0, else it equals the response for the previous query plus one.
2. Introduce function f(z) = ((z - 1 + x) mod n) + 1.
3. Suppose l₁ = min(f(a), f(b)), r₁ = max(f(a), f(b)), l₂ = min(f(c), f(d)), r₂ = max(f(c), f(d)).

Output:

Print a response for each query in a separate line.

Sample Input:

3
3 1 2
3 2 1
1
1 2 3 3

Sample Output:

1

Sample Input:

4
4 3 2 1
2 3 4 1
3
1 2 3 4
1 3 2 1
1 4 2 3

Sample Output:

1
1
2