#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 7;
int a[MAXN], st[MAXN], d[MAXN][27], L[MAXN], R[MAXN];
long long fd[MAXN], f[MAXN], sf[MAXN], gd[MAXN], g[MAXN], sg[MAXN];
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
  }
  int top;
  st[top = 0] = 0;
  for (int i = 1; i <= n; i++) {
    while (top && a[st[top]] < a[i]) --top;
    fd[i] = top;
    f[i] = f[i - 1] + top + i - st[top];
    sf[i] = sf[i - 1] + f[i];
    st[++top] = i;
  }
  a[st[top = 0] = n + 1] = 0;
  for (int i = n; i >= 1; i--) {
    while (top && a[st[top]] < a[i]) --top;
    gd[i] = top;
    g[i] = g[i + 1] + st[top] - i + top;
    sg[i] = sg[i + 1] + g[i];
    st[++top] = i;
  }
  for (int i = 1; i <= n; i++) d[i][0] = i;
  for (int j = 1; (1 << j) <= n; j++)
    for (int i = 1; i + (1 << j) - 1 <= n; i++)
      if (a[d[i][j - 1]] > a[d[i + (1 << (j - 1))][j - 1]])
        d[i][j] = d[i][j - 1];
      else
        d[i][j] = d[i + (1 << (j - 1))][j - 1];
  for (int i = 1; i <= q; i++) scanf("%d", L + i);
  for (int i = 1; i <= q; i++) scanf("%d", R + i);
  int k;
  for (int i = 1; i <= q; i++) {
    if (L[i] > R[i]) swap(L[i], R[i]);
    k = 0;
    while (1 << (k + 1) <= R[i] - L[i] + 1) k++;
    if (a[d[L[i]][k]] > a[d[R[i] - (1 << k) + 1][k]])
      k = d[L[i]][k];
    else
      k = d[R[i] - (1 << k) + 1][k];
    long long ans = -fd[k] * (R[i] - k) - gd[k] * (k - L[i]) + 1;
    ans += f[R[i]] - f[k];
    ans += g[L[i]] - g[k];
    printf("%lld ", ans);
  }
  return 0;
}
