#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define int long long
using namespace std;
struct DSU{
int n;
vector<int> p;
vector<int> sz;
DSU(int size){
n = size;
p.resize(n + 1, -1);
sz.resize(n + 1);
for(int i = 0; i <= n; i++){
sz[i] = 1;
}
}
int find(int u){
if(p[u] == -1) return u;
return p[u] = find(p[u]);
}
void unite(int u, int v){
int a = find(u);
int b = find(v);
if(a != b){
// if(sz[a] < sz[b]) swap(a, b);
p[b] = a;
sz[a] += sz[b];
}
}
int fi(int u){
int v = find(u);
int a = sz[v];
return (a * (a - 1)) / 2;
}
};
signed main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> q(m);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < m; i++){
cin >> q[i].ff;
q[i].ss = i;
}
vector<int> B = a;
sort(B.begin(), B.end());
sort(q.begin(), q.end());
vector<pair<int, int>> d;
for(int i = 0; i < n - 1; i++){
d.push_back({max(a[i], a[i + 1]), i});
}
DSU dsu(n + 1);
int cur = 0;
int idx = 0;
sort(d.begin(), d.end());
vector<int> t(m);
for(int i = 0; i < m; i++){
while(idx < n - 1 && d[idx].ff <= q[i].ff){
int id = d[idx].ss;
cur -= dsu.fi(id);
cur -= dsu.fi(id + 1);
dsu.unite(id, id + 1);
cur += dsu.fi(id);
idx += 1;
}
int nm = upper_bound(B.begin(), B.end(), q[i].ff) - B.begin();
t[q[i].ss] = cur + nm;
}
for(int i = 0; i < m; i++){
cout << t[i] << endl;
}
// for(auto t : d){
// cout << t.ff << " " << t.ss;
// cout << endl;
// }
}
