// UUID: 0d1a1bbb-f87b-4651-9ee6-f311f4222511
#pragma GCC optimize("O3,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<int> numLess, previous;
vector<vector<int>> nbrs;

int calcLess(int Indx){
    if(0<=numLess[Indx]) return numLess[Indx];
    int ans=0;
    for(int x : nbrs[Indx]) ans=max(ans, calcLess(x)+1);
    return numLess[Indx]=ans;
}

void calcLess2(){
    for (int i = n - 1; i >= 0; i--){
        if(previous[i] != -1) numLess[previous[i]] = max(numLess[previous[i]], numLess[i] + 1);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    vector<long long> sortedArr(n+k);
    vector<int> h(n+1), towerH(k);
    for(int i=0;i<n;i++){
        cin >> h[i];
        sortedArr[i]=(((long long)(h[i])<<32)|i);
    }
    for(int i=0;i<k;i++){
        cin >> towerH[i];
        sortedArr[n+i]=(((long long)(towerH[i])<<32)|n+i);
    }
    h[n]=INT_MAX;
    sort(sortedArr.begin(), sortedArr.end());
    stack<int> stc;
    stc.push(n);
    nbrs.resize(n+1);
    previous.resize(n+1, -1);
    for(int i=0;i<n;i++){
        while(h[stc.top()]<h[i]) stc.pop();
        // nbrs[stc.top()].push_back(i);
        previous[i] = stc.top();
        stc.push(i);
    }
    numLess.resize(n+1, 0); // te itt eddig 0-ra resizeoltál
    // calcLess(n);
    calcLess2();
    int bestSoFar=0;
    vector<int>& ans=towerH;
    for(int i=0;i<n+k;i++){
        sortedArr[i]&=0xffffffff;
        if(n<=sortedArr[i]){
            towerH[sortedArr[i]-n]=bestSoFar+1;
        }
        else{
            bestSoFar=max(bestSoFar, numLess[sortedArr[i]]);
        }
    }
    for(int i=0;i<k;i++) cout << towerH[i] << ' ';
}