//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int,int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up
int32_t main(){
boost;
int N,Q; cin>>N>>Q;
int t[N];
for(int i=0; i<N; i++) cin>>t[i];
if(N*Q<=(int)1e7){
for(int i=0; i<Q; i++){
int mx; cin>>mx;
int res=0,cnt=0;
for(int j=0; j<N; j++){
if(t[j]>mx){
res+=((cnt+1)*cnt)/2;
cnt=0;
}
else cnt++;
if(j==N-1) res+=((cnt+1)*cnt)/2;
}
cout << res << endl;
}
}
else{
while(Q--){
int mx; cin>>mx;
auto it=upper_bound(t,t+N,mx)-t;
cout << (it*(it+1))/2 << endl;
}
}
return 0;
}
