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

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1008611;
struct ST {
  int i, j, l, r, mid;
  vector<int> vv;
} st[maxn * 4];
int p1[maxn];
int p2[maxn];
int xx[maxn];
void bd(int d, int x, int y) {
  st[d].i = x, st[d].j = y;
  st[d].mid = (x + y) >> 1;
  st[d].vv.clear();
  for (int i = x; i <= y; i++) st[d].vv.push_back(xx[i]);
  sort(st[d].vv.begin(), st[d].vv.end());
  if (x < y) {
    st[d].l = d << 1;
    st[d].r = d << 1 | 1;
    bd(st[d].l, x, st[d].mid);
    bd(st[d].r, st[d].mid + 1, y);
  }
}
int query(int d, int x, int y, int l2, int r2) {
  if (x <= st[d].i && y >= st[d].j) {
    int ll =
        lower_bound(st[d].vv.begin(), st[d].vv.end(), l2) - st[d].vv.begin();
    int rr =
        upper_bound(st[d].vv.begin(), st[d].vv.end(), r2) - st[d].vv.begin();
    return rr - ll;
  } else {
    int temp = 0;
    if (x <= st[d].mid) temp += query(st[d].l, x, y, l2, r2);
    if (y > st[d].mid) temp += query(st[d].r, x, y, l2, r2);
    return temp;
  }
}
int n;
int rr = 0;
int f(int z) { return ((z - 1 + rr) % n) + 1; }
int tmp[maxn];
int main() {
  while (cin >> n) {
    for (int i = 1; i <= n; i++) scanf("%d", &p1[i]);
    for (int i = 1; i <= n; i++) scanf("%d", &p2[i]);
    for (int i = 1; i <= n; i++) tmp[p2[i]] = i;
    for (int i = 1; i <= n; i++) xx[i] = tmp[p1[i]];
    int m;
    bd(1, 1, n);
    cin >> m;
    rr = 0;
    int a, b, c, d;
    while (m--) {
      scanf("%d%d%d%d", &a, &b, &c, &d);
      int l1, r1, l2, r2;
      l1 = min(f(a), f(b));
      r1 = max(f(a), f(b));
      l2 = min(f(c), f(d));
      r2 = max(f(c), f(d));
      rr = query(1, l1, r1, l2, r2);
      printf("%d", rr);
      rr++;
    }
  }
  return 0;
}
