#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
const int MAX = 1e6 + 5;
int N, M;
pair<int, int> h[MAX], a[MAX];
struct Dsu{
int n;
vector<int> par, sz;
Dsu(int _n = 0){
this -> n = _n;
par.resize(n + 5);
sz.resize(n + 5);
for (int i = 1; i <= n; ++i) sz[i] = 1;
iota(par.begin(), par.end(), 0ll);
}
int find(int u){
return u == par[u] ? u : par[u] = find(par[u]);
}
bool unite(int u, int v){
u = find(u), v = find(v);
if (u == v) return 0;
if (sz[u] < sz[v]) swap(u, v);
sz[u] += sz[v];
par[v] = u;
sz[v] = 0;
return 1;
}
};
int ans[MAX];
int vis[MAX];
void Whisper(){
cin >> N >> M;
for (int i = 1; i <= N; ++i) cin >> h[i].first, h[i].second = i;
for (int i = 1; i <= M; ++i) cin >> a[i].first, a[i].second = i;
sort(h + 1, h + N + 1);
sort(a + 1, a + M + 1);
Dsu dsu(N);
int j = 1;
int res = 0;
for (int i = 1; i <= M; ++i){
while (j <= N && h[j].first <= a[i].first){
int pos = h[j].second;
int lf = 0, rg = 0;
if (vis[pos - 1])
lf = dsu.sz[dsu.find(pos - 1)];
if (vis[pos + 1])
rg = dsu.sz[dsu.find(pos + 1)];
res += (lf + 1) * (rg + 1);
if (vis[pos - 1]) dsu.unite(pos, pos - 1);
if (vis[pos + 1]) dsu.unite(pos, pos + 1);
vis[pos] = 1;
++j;
}
ans[a[i].second] = res;
}
for (int i = 1; i <= M; ++i){
cout << ans[i] << "\n";
}
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
