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

# encoding: utf-8
__author__ = 'rekby'

cache = {}

def f(z, x, n):
    return ((z - 1 + x) % n) + 1


def get_params(a, b, c, d, n, x):
    fa, fb, fc, fd = f(a, x, n), f(b, x, n), f(c, x, n), f(d, x, n)
    l1, r1, l2, r2 = min(fa, fb), max(fa, fb), min(fc, fd), max(fc,fd)
    return l1, r1, l2, r2


# возвращает seq (seq, pos)
def parse_numbers(s):
    nums = s.split(' ')
    seq = [0] * (len(nums) + 1)  # добавляем нулевой элемент, чтобы смысловые индексировались начиная с 1
    pos = [0] * (len(nums) + 1)  # поскольку индексация начинается с нуля добавляем 1 элемент, чтобы дальше работать с индексами с 1
    for i in xrange(len(nums)):
        n = int(nums[i])
        seq[i+1] = n
        pos[n] = i + 1  # позиция числа в последовательности
    return seq, pos


# Проверяем количество чисел первого интервала, находящихся во втором интервале
def check(nums1, l1, r1, nums2, l2, r2):
    # делаем так что первый интервал всегда короче
    if r2 - l2 < r1 - l1:
        check(nums2, l2, r2, nums1, l1, r1)
    a1 = nums1[0]
    p2 = nums2[1]
    n = len(a1) - 1
    out_numbers = n - (r2-l2+1)  # Количество чисел не вошедших во второй интервал
    out_finded = 0  # out_numbers, встреченные в первом интервале
    cnt = 0
    i = l1
    # уловие окончания: проверен весь первый отрезок или найдены все числа, не входящие во второй отрезок
    # после выхода из цикла i указывает на элемент, следующий за последним проверенным
    while out_finded < out_numbers and i <= r1:
        n = a1[i]
        pos2 = p2[n]
        if l2 <= pos2 <= r2:
            cnt += 1
        else:
            out_finded += 1
        i += 1
    if out_finded == out_numbers:  # Если найдены все числа, не вошедние во второй интервал
        # тогда в интервал входят все найденные числа + те которые еще не проверены
        return cnt + (r1 - i + 1)
    else:
        return cnt


def cache_check(l1,r1, l2, r2):
    key = '%s-%s-%s-%s' % (l1, r1, l2, r2)
    if key in cache:
        return cache[key]
    else:
        return None


def cache_put(l1, r1, l2, r2, value):
    key = '%s-%s-%s-%s' % (l1, r1, l2, r2)
    cache[key] = value


def main():
    n = int(raw_input())
    seq1string = raw_input()
    seq1 = parse_numbers(seq1string)
    seq2string = raw_input()
    seq2 = parse_numbers(seq2string)
    m = int(raw_input())
    x = 0
    for i in xrange(m):
        s = raw_input()
        a, b, c, d = s.split(' ')
        a, b, c, d = int(a), int(b), int(c), int(d)
        l1, r1, l2, r2 = get_params(a, b, c, d, n, x)
        res = cache_check(l1, r2, l2, r2)
        if res is None:
            res = check(seq1, l1, r1, seq2, l2, r2)
            cache_put(l1, r1, l2, r2, res)
        print res
        x = res + 1

def maint():
    s1 = '1 3 4 2'
    s2 = '4 2 3 1'
    n1 = parse_numbers(s1)
    n2 = parse_numbers(s2)
    print check(n1, 1, 2, n2, 1, 3)

if __name__ == '__main__':
    main()