#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

int main()
{
    int n, m;
    cin >> n >> m;

    vector<int> alap(n);
    for(int &x : alap){
        cin >> x;
    }


    vector<pii> kerdes(m);
    for(int i = 0; i < m; i++){
        cin >> kerdes[i].first;
        kerdes[i].second = i;
    }

    sort(kerdes.begin(), kerdes.end());

    vector<int> ans(m);

    int magas = 1;
    int ind = 0;
    for(int i = 0; i < n && ind < m; i++){
        if(magas >= alap[i]) continue;

        int uj = alap[i];

        while(ind < m && kerdes[ind].first < uj){
            ans[kerdes[ind].second] = i + 1;
            ind++;
        }

        magas = uj;
    }

    for(int x : ans){
        cout << x << "\n";
    }
}