// UUID: 822faa19-1b46-4c7c-af88-02df6312b54a
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define vi vector<int>
#define pii pair<int,int>

const int maxn=1e6+1;

int tree[4*maxn+10];
int prop[4*maxn+10];

void do_prop(int ind, int L, int R){
    int cur=prop[ind];
    tree[ind]+=cur;
    prop[ind]=0;

    if (L==R) return;

    prop[2*ind]+=cur;
    prop[2*ind+1]+=cur;

    int M=(L+R)/2;
    do_prop(2*ind, L, M);
    do_prop(2*ind+1, M+1, R);
    tree[ind] = max(tree[2*ind], tree[2*ind+1]);
}

void add(int ind, int l, int r, int x, int L, int R){
    if (R<l || r<L) return;
    do_prop(ind, L, R);

    if (l<=L && R<=r){
        prop[ind]+=x;
        do_prop(ind, L, R);
        return;
    }

    int M = (L+R)/2;
    add(2*ind, l, r, x, L, M);
    add(2*ind+1, l, r, x, M+1, R);
}

int get(int ind, int l, int r, int L, int R){
    if (R<l || r<L) return -1;
    do_prop(ind, L, R);

    if (l<=L && R<=r){
        return tree[ind];
    }

    int M=(L+R)/2;
    int res = -1;
    res = max(res, get(2*ind, l, r, L, M));
    res = max(res, get(2*ind+1, l, r, M+1, R));
    return res;
}

void solve(){
    int n, k;
    cin>>n>>k;
    vector<int> h(n+2);
    vector<pair<int,int>> hsrt(n+1);
    vector<int> nxt(n+1);
    stack<int> mon;
    
    for (int i=1;i<=n;i++) {
        cin>>h[i];
        hsrt[i]={h[i], i};
    }
    sort(all(hsrt));
    h[n+1]=INT_MAX;
    mon.push(n+1);
    for (int i=n;i>0;i--){
        while (h[mon.top()]<h[i]) mon.pop();
        nxt[i]=mon.top();
        mon.push(i);
    }
    vector<pair<int,int>> q(k);
    vector<int> ans(k);
    for (int i=0;i<k;i++){
        cin>>q[i].first;
        q[i].second=i;
    }
    sort(all(q));

    int cur=1;
    for (auto [a, i] : q){
        while (cur<=n && hsrt[cur].first<a){
            int ind = hsrt[cur].second;
            add(1, ind, nxt[ind]-1, 1, 1, n);
            cur++;
        }
        ans[i]=get(1, 1, n, 1, n);
    }
    for (int i=0;i<k;i++) cout<<ans[i]<<" ";

}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t=1;
    //cin>>t;
    while (t--){
        solve();
    }
}