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;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using ll = long long;
using pi = pair<int, int>;
using vi = vc<int>;
using vvi = vvc<int>;
int topbit(int t) {
  assert(t > 0);
  return 31 - __builtin_clz(t);
}
struct X {
  int s;
  vvi buf;
  X(vi first) {
    s = 1;
    while (s < int((first).size())) s *= 2;
    buf.resize(2 * s);
    for (int i = int(1); i < int(2 * s); i++) buf[i] = vi(s >> topbit(i));
    for (int i = int(0); i < int(int((first).size())); i++)
      buf[s + i][0] = first[i];
    for (int i = int(s) - 1; i >= int(1); i--)
      merge((buf[2 * i]).begin(), (buf[2 * i]).end(), (buf[2 * i + 1]).begin(),
            (buf[2 * i + 1]).end(), buf[i].begin());
  }
  int in(int i, int second, int e) {
    if (e < buf[i].front() || buf[i].back() < second)
      return 0;
    else
      return distance(lower_bound((buf[i]).begin(), (buf[i]).end(), second),
                      lower_bound((buf[i]).begin(), (buf[i]).end(), e));
  }
  int get(int second, int e, int b1, int e1) {
    int i = second + s;
    int j = e + s;
    int res = 0;
    while (i < j) {
      if (i & 1) res += in(i++, b1, e1);
      if (j & 1) res += in(--j, b1, e1);
      i /= 2;
      j /= 2;
    }
    return res;
  }
};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vi p(n);
  for (int i = int(0); i < int(n); i++) {
    cin >> p[i];
    p[i]--;
  }
  vi q(n);
  for (int i = int(0); i < int(n); i++) {
    cin >> q[i];
    q[i]--;
  }
  vi iq(n);
  for (int i = int(0); i < int(n); i++) iq[q[i]] = i;
  vi v(n);
  for (int i = int(0); i < int(n); i++) v[i] = iq[p[i]];
  X x(v);
  int m;
  cin >> m;
  int last = 0;
  auto f = [&](int z) -> int { return (z + last - 1) % n + 1; };
  for (int _ = int(0); _ < int(m); _++) {
    int first, second, c, d;
    cin >> first >> second >> c >> d;
    int l1 = min(f(first), f(second)) - 1;
    int r1 = max(f(first), f(second));
    int l2 = min(f(c), f(d)) - 1;
    int r2 = max(f(c), f(d));
    last = x.get(l1, r1, l2, r2);
    cout << last << '\n';
    last++;
  }
}
