#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int MAXN = 1000005;
int N, Q;
ll H[MAXN];
pair<ll, int> Y[MAXN];
vector<pair<ll, int>> sortedH;
int parent[MAXN], sz[MAXN];
bool active[MAXN];
ll cur = 0;
ll ans[MAXN];
int components = 0;
int findRoot(int u){
return (parent[u] == u ? u : parent[u] = findRoot(parent[u]));
}
void unite(int u, int v){
u = findRoot(u);
v = findRoot(v);
if (u == v) return;
if (sz[u] < sz[v]) swap(u, v);
parent[v] = u;
components--;
cur -= (1LL * sz[u] * (sz[u] + 1)) / 2;
cur -= (1LL * sz[v] * (sz[v] + 1)) / 2;
sz[u] += sz[v];
cur += (1LL * sz[u] * (sz[u] + 1)) / 2;
}
void solve(){
cin >> N >> Q;
for (int i = 1; i <= N; ++i){
cin >> H[i];
sortedH.emplace_back(H[i], i);
}
sort(ALL(sortedH));
for (int i = 1; i <= Q; ++i){
ll y; cin >> y;
Y[i] = {y, i};
}
sort(Y + 1, Y + 1 + Q);
for (int i = 1; i <= N; ++i){
parent[i] = i;
sz[i] = 0;
}
int ptr = 0;
for (int i = 1; i <= Q; ++i){
while (ptr < (int)sortedH.size() && sortedH[ptr].first <= Y[i].first){
int idx = sortedH[ptr].second;
active[idx] = true;
sz[idx] = 1;
cur++;
components++;
if (idx > 1 && active[idx - 1]) unite(idx, idx - 1);
if (idx < N && active[idx + 1]) unite(idx, idx + 1);
ptr++;
}
ans[Y[i].second] = cur;
}
for (int i = 1; i <= Q; ++i)
cout << ans[i] << "\n";
}
int main(void){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
return 0;
}
