Problem: You are given a permutation p_1, p_2, ..., p_n. You should answer q queries. Each query is a pair (l_i, r_i), and you should calculate f(l_i, r_i).

Let's denote m_{l, r} as the position of the maximum in subsegment p_l, p_{l+1}, ..., p_r.

Then f(l, r) = (r - l + 1) + f(l, m_{l,r} - 1) + f(m_{l,r} + 1, r) if l ≤ r or 0 otherwise.

Input

The first line contains two integers n and q (1 ≤ n ≤ 10^6, 1 ≤ q ≤ 10^6) — the size of the permutation p and the number of queries.

The second line contains n pairwise distinct integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n, p_i ≠ p_j for i ≠ j) — permutation p.

The third line contains q integers l_1, l_2, ..., l_q — the first parts of the queries.

The fourth line contains q integers r_1, r_2, ..., r_q — the second parts of the queries.

It's guaranteed that 1 ≤ l_i ≤ r_i ≤ n for all queries.

Output

Print q integers — the values f(l_i, r_i) for the corresponding queries.

Example

Input


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


Output


1 6 8 5 1 

Note

Description of the queries: 

  1. f(2, 2) = (2 - 2 + 1) + f(2, 1) + f(3, 2) = 1 + 0 + 0 = 1; 
  2. f(1, 3) = (3 - 1 + 1) + f(1, 2) + f(4, 3) = 3 + (2 - 1 + 1) + f(1, 0) + f(2, 2) = 3 + 2 + (2 - 2 + 1) = 6; 
  3. f(1, 4) = (4 - 1 + 1) + f(1, 2) + f(4, 4) = 4 + 3 + 1 = 8; 
  4. f(2, 4) = (4 - 2 + 1) + f(2, 2) + f(4, 4) = 3 + 1 + 1 = 5; 
  5. f(1, 1) = (1 - 1 + 1) + 0 + 0 = 1. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1E6 + 10;
const int inf = 1 << 30;
long long read() {
  long long a = 0;
  char b = 1, c;
  do
    if ((c = getchar()) == 45) b = -1;
  while (c < 48 || c > 57);
  do a = (a << 3) + (a << 1) + (c & 15);
  while ((c = getchar()) > 47 && c < 58);
  return a * b;
}
void write(long long x, char c) {
  if (x < 0) putchar(45), x = -x;
  char a[20], s = 0;
  do a[++s] = x % 10 | 48;
  while (x /= 10);
  do putchar(a[s]);
  while (--s);
  putchar(c);
}
int n, m;
int a[N], u[N], v[N];
int head[N], nex[N], to[N], cnt;
pair<int, int> q[N];
long long ans[N];
int l[N << 2], r[N << 2], laz[N << 2];
long long sum[N << 2];
void addedge(int u, int v) {
  nex[++cnt] = head[u];
  head[u] = cnt;
  to[cnt] = v;
}
void dt(int i, int val) {
  sum[i] += (r[i] - l[i] + 1) * 1LL * val;
  laz[i] += val;
}
void push_down(int i) {
  if (!laz[i]) return;
  dt(i << 1, laz[i]);
  dt(i << 1 | 1, laz[i]);
  laz[i] = 0;
}
void build(int i, int L, int R) {
  l[i] = L;
  r[i] = R;
  if (L == R) return;
  int M = L + R >> 1;
  build(i << 1, L, M);
  build(i << 1 | 1, M + 1, R);
}
void cha(int i, int L, int R) {
  if (l[i] > R || r[i] < L) return;
  if (l[i] >= L && r[i] <= R)
    dt(i, 1);
  else {
    push_down(i);
    cha(i << 1, L, R);
    cha(i << 1 | 1, L, R);
    sum[i] = sum[i << 1] + sum[i << 1 | 1];
  }
}
long long ask(int i, int L, int R) {
  if (l[i] > R || r[i] < L) return 0;
  if (l[i] >= L && r[i] <= R) return sum[i];
  push_down(i);
  return ask(i << 1, L, R) + ask(i << 1 | 1, L, R);
}
void solve() {
  for (int i = 1; i <= m; ++i) addedge(v[i], i);
  for (int i = 1, s = 0; i <= n; ++i) {
    pair<int, int> y = make_pair(i, i);
    while (a[q[s].second] < a[i]) {
      cha(1, q[s].first, q[s].second);
      y.first = q[s].first;
      --s;
    }
    q[++s] = y;
    for (int j = head[i]; j; j = nex[j]) {
      int t = to[j];
      ans[t] += ask(1, u[t], i);
    }
  }
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 1; i <= m; ++i) u[i] = read();
  for (int i = 1; i <= m; ++i) v[i] = read();
  a[0] = inf;
  build(1, 1, n);
  solve();
  reverse(a + 1, a + 1 + n);
  memset(head + 1, 0, n << 2);
  memset(sum, 0, sizeof sum);
  memset(laz, 0, sizeof laz);
  cnt = 0;
  for (int i = 1; i <= m; ++i) {
    int t = n + 1 - u[i];
    u[i] = n + 1 - v[i];
    v[i] = t;
  }
  solve();
  for (int i = 1; i <= m; ++i) {
    write(ans[i] + v[i] - u[i] + 1, ' ');
  }
}