#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
const int N = 1000002;
ll ans[N];
vector<int> v[N];
ll cur;
struct UFDS {
vector<int> p;
vector<ll> siz;
void init(int n){
p.resize(n + 2);
siz.resize(n + 2);
for(int i = 0; i <= n; i++){
p[i] = i;
siz[i] = 0;
}
}
void set(int x){
siz[x] = 1;
cur++;
}
int get(int x){
return p[x]=(x==p[x] ? x : get(p[x]));
}
void unio(int u , int vt){
int a = get(u);
int b=get(vt);
if(a==b)return;
if(siz[a]>siz[b])swap(a,b);
p[b]=a;
cur -= (siz[a] * (siz[a]+1))/2;
cur -= (siz[b] * (siz[b]+1))/2;
siz[a]+=siz[b];
cur += (siz[a] * (siz[a]+1))/2;
}
};
void solve(){
int n , q;
cin >> n >> q;
int arr[n];
for(int i = 0; i < n; i++){cin >> arr[i];v[arr[i]].pb(i);}
UFDS d;
d.init(n + 2);
cur = 0;
for(int i = 1; i <= 1000000; i++){
for(int j : v[i]){
d.set(j);
}
for(int j : v[i]){
if(j - 1 >= 0 && arr[j-1] <= i)d.unio(j,j-1);
if(j + 1 < n && arr[j + 1] <= i)d.unio(j,j+1);
}
ans[i] = cur;
}
while(q--){
int x;
cin >> x;
cout << ans[x] << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//int t;cin >> t;while(t--)
solve();
return 0;
}
