#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const int N = 1e6 + 5;
vector<int> v(N);
vector<pair<pair<int, int>, int>> qry;
vector<int> x(N, -1), y(N, -1);
long long segtree[4 * N][2], lazy[4 * N][2];
long long ans[N];
int n, q;
void f() {
  v[0] = N, v[n + 1] = N;
  stack<int> st;
  for (int i = 0; i <= n; i++) {
    while (!st.empty() && v[st.top()] < v[i]) st.pop();
    if (!st.empty()) x[i] = st.top();
    st.push(i);
  }
  while (!st.empty()) st.pop();
  for (int i = n + 1; i > 0; i--) {
    while (!st.empty() && v[st.top()] < v[i]) st.pop();
    if (!st.empty()) y[i] = st.top();
    st.push(i);
  }
}
bool comp_l(pair<pair<int, int>, int> &a, pair<pair<int, int>, int> &b) {
  return a < b;
}
bool comp_r(pair<pair<int, int>, int> &a, pair<pair<int, int>, int> &b) {
  return make_pair(make_pair(a.first.second, a.first.first), a.second) <
         make_pair(make_pair(b.first.second, b.first.first), b.second);
}
void spread(int node, int f, int l, int r) {
  if (lazy[node][f] != 0) {
    segtree[node][f] += 1LL * (r - l + 1) * lazy[node][f];
    if (l != r) {
      lazy[2 * node + 1][f] += lazy[node][f];
      lazy[2 * node + 2][f] += lazy[node][f];
    }
  }
  lazy[node][f] = 0;
}
void update(int x, int y, int f, int val, int node = 0, int l = 1, int r = n) {
  spread(node, f, l, r);
  if (l > y || r < x || x > y) return;
  if (x <= l && r <= y) {
    lazy[node][f] += val;
    spread(node, f, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  update(x, y, f, val, 2 * node + 1, l, mid);
  update(x, y, f, val, 2 * node + 2, mid + 1, r);
  segtree[node][f] = segtree[2 * node + 1][f] + segtree[2 * node + 2][f];
}
long long query(int x, int y, int f, int node = 0, int l = 1, int r = n) {
  spread(node, f, l, r);
  if (l > y || r < x || x > y) return 0;
  if (x <= l && r <= y) return segtree[node][f];
  int mid = (l + r) >> 1;
  long long a = query(x, y, f, 2 * node + 1, l, mid);
  long long b = query(x, y, f, 2 * node + 2, mid + 1, r);
  return a + b;
}
void solve() {
  f();
  {
    sort(qry.begin(), qry.end(), comp_r);
    int idx = 1;
    for (int i = 0; i < q; i++) {
      int l = qry[i].first.first;
      int r = qry[i].first.second;
      int id = qry[i].second;
      while (idx <= r) {
        update(x[idx] + 1, idx - 1, 0, 1);
        idx++;
      }
      long long temp = query(l, r, 0);
      ans[id] += temp;
    }
  }
  {
    sort(qry.rbegin(), qry.rend(), comp_l);
    int idx = n;
    for (int i = 0; i < q; i++) {
      int l = qry[i].first.first;
      int r = qry[i].first.second;
      int id = qry[i].second;
      while (idx >= l) {
        update(idx + 1, y[idx] - 1, 1, 1);
        idx--;
      }
      long long temp = query(l, r, 1);
      ans[id] += temp;
    }
  }
  for (int i = 0; i < q; i++) {
    int l = qry[i].first.first;
    int r = qry[i].first.second;
    int idx = qry[i].second;
    ans[idx] += (r - l + 1);
  }
  for (int i = 0; i < q; i++) cout << ans[i] << ' ';
  cout << "\n";
}
int main() {
  fast();
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> v[i];
  for (int i = 0; i < q; i++) {
    int a;
    cin >> a;
    qry.push_back(make_pair(make_pair(a, -1), i));
  }
  for (int i = 0; i < q; i++) cin >> qry[i].first.second;
  solve();
}
