#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1 << (x))
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
return l + rd() % (r - l + 1);
}
const int N = 1e6 + 5;
const int mod = 1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int inf = 1e9; // INT_MAX;
const long long llinf = 1e18; // LLONG_MAX;
template<class X, class Y>
bool minimize(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y>
bool maximize(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
template<class X, class Y>
bool add(X &a, Y b) {
a += b;
while (a >= mod) a -= mod;
while (a < 0) a += mod;
return true;
}
int n, q;
int a[N];
int l[N], r[N];
long long d[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; ++i)
cin >> a[i];
stack<int> st;
for (int i = 1; i <= n; ++i) {
while (st.size() && a[st.top()] < a[i]) st.pop();
l[i] = st.size() ? st.top() : 0;
st.push(i);
}
st = stack<int>{};
for (int i = n; i >= 1; --i) {
while (st.size() && a[st.top()] <= a[i]) st.pop();
r[i] = st.size() ? st.top() : n + 1;
st.push(i);
}
for (int i = 1; i <= n; ++i) {
d[a[i]] += 1LL * (i - l[i]) * (r[i] - i);
}
for (int i = 1; i <= 1e6; ++i)
d[i] += d[i - 1];
while (q--) {
int x;
cin >> x;
cout << d[x] << '\n';
}
return 0;
}
/*
6 3
1 3 2 4 1 2
2 3 4
5
9
21
*/
