You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1, l2, r2 (l1 ≤ r1; l2 ≤ r2). The response for the query is the number of such integers from 1 to n, that their position in the first permutation is in segment [l1, r1] (borders included), and position in the second permutation is in segment [l2, r2] (borders included too).

A permutation of n elements is the sequence of n distinct integers, each not less than 1 and not greater than n.

Position of number v (1 ≤ v ≤ n) in permutation g1, g2, ..., gn is such number i, that gi = v.

Input

The first line contains one integer n (1 ≤ n ≤ 106), the number of elements in both permutations. The following line contains n integers, separated with spaces: p1, p2, ..., pn (1 ≤ pi ≤ n). These are elements of the first permutation. The next line contains the second permutation q1, q2, ..., qn in same format.

The following line contains an integer m (1 ≤ m ≤ 2·105), 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 l1, r1, l2, r2 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 l1 = min(f(a), f(b)), r1 = max(f(a), f(b)), l2 = min(f(c), f(d)), r2 = max(f(c), f(d)). 

Output

Print a response for each query in a separate line.

Examples

Input

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


Output

1


Input

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


Output

1
1
2
1
1
1
1
1 1 1 1

1


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created with IntelliJ IDEA.
 * User: balbasaur
 * Date: 21/3/13
 * Time: 8:49 PM
 * To change this template use File | Settings | File Templates.
 */
public class Problem {
    public static void permutation(int testNumber ,InputReader in, PrintWriter out){
        int n,m;
        n = in.nextInt();
        int p[] = new int[n + 1];
        int q[] = new int[n + 1];
        for (int i = 1; i <= n ;i++){
            p[i] = in.nextInt();
        }
        int k = 0;
        for (int i = 1; i <= n ;i++){
            k = in.nextInt();
            q[k] = i;
        }
        m = in.nextInt();
        int a,b,c,d,l1 = 0,l2 = 0,r1 = 0,r2 = 0;
        int count = 0;
        for (int i = 0; i < m; i++){
            count = 0;
            a = in.nextInt();
            b = in.nextInt();
            c= in.nextInt();
            d = in.nextInt();
            if (a <= b){
                  l1 = a;
                  r1 = b;
            }
            if (a > b){
                  l1 = b;
                  r1 = a;
            }
            if(c >= d){
                l2 = d;
                r2 = c;
            }
            if(c < d){
                l2 = c;
                r2 = d;
            }
            for (int start = l1; start <= r1; start++){
                if (q[p[start]] >= l2 && q[p[start]] <= r2){
                    count++;
                }
            }
            out.println(count);

        }







    }
    public static void main(String[] args) {

        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        permutation(1,in,out);
        out.close();


    }
}
class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}