#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<int> heights(N);
    for(int i = 0; i < N; i++){
        cin >> heights[i];
    }
    vector<int> neededHeight(N);
    neededHeight[0] = heights[0];
    for(int i = 1; i < N; i++){
        neededHeight[i] = max(neededHeight[i-1], heights[i]);
    }
    for(int i = 0; i < Q; i++){
        int currHeight;
        cin >> currHeight;
        cout << (lower_bound(neededHeight.begin(), neededHeight.end(), currHeight+1) - neededHeight.begin()) + 1 << '\n';
    }
    return 0;
}