#include <bits/stdc++.h>
#define int long long
using namespace std;
const int nmax = 1e6 + 1;
struct str {
int aa, i;
} a[nmax], ord[nmax];
int v[nmax], ans[nmax], sz[nmax], root[nmax];
bool f[nmax];
int cmp(str x, str y) {
return x.aa < y.aa;
}
int find(int a) {
if(root[a] == a) {
return a;
}
return root[a] = find(root[a]);
}
int curr = 0;
void unite(int a, int b) {
if(a == b) {
cout << a << " " << b << '\n';
exit(0);
// assert(0); // nu cred ca ar tb sa aj aici
}
if(sz[a] < sz[b]) {
swap(a, b);
}
curr += sz[a] * sz[b];
// cout << "+ " << sz[a] << " " << sz[b] << '\n';
root[b] = a;
sz[a] += sz[b];
}
void upd(int a) {
f[a] = 1;
curr++;
if(f[a - 1] == 1) {
// cout << "? " << a << " " << a - 1 << '\n';
unite(find(a), find(a - 1));
}
if(f[a + 1] == 1) {
// cout << "! " << a << " " << a + 1 << '\n';
unite(find(a), find(a + 1));
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
int n, q;
cin >> n >> q;
for(int i = 1; i <= n; i++) {
sz[i] = 1, root[i] = i;
cin >> v[i];
ord[i].aa = v[i];
ord[i].i = i;
}
sort(ord + 1, ord + n + 1, cmp);
for(int i = 1; i <= q; i++) {
cin >> a[i].aa;
a[i].i = i;
}
sort(a + 1, a + q + 1, cmp);
int j = 1;
for(int i = 1; i <= q; i++) { // rainboy orz
while(j <= n && ord[j].aa <= a[i].aa) {
// cout << "~ " << ord[j].i << "\n";
upd(ord[j].i);
j++;
}
ans[a[i].i] = curr;
// cout << '\n';
}
for(int i = 1; i <= q; i++) {
cout << ans[i] << "\n";
}
return 0;
}
