wieza

#include <algorithm>
#include <iostream>
#include <vector>

int main(void) {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(0);

    int height, n, m;
    std::cin >> n >> m;

    std::vector<int> stairs(n);
    std::cin >> stairs[0];
    for (int i = 1; i < stairs.size(); ++i) {
        std::cin >> stairs[i];
        stairs[i] = std::max(stairs[i - 1], stairs[i]);
    }

    while (m--) {
        std::cin >> height;
        int index = std::upper_bound(stairs.rbegin(), stairs.rend(), height, std::greater<int>()) - stairs.rbegin();
        std::cout << stairs.size() - index << " ";
    }
    std::cout << std::endl;
    return 0;
}