#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
    cin>>n>>m;
    vector<long long int>haz(n+1, 0);
    map<long long int, int>k;
    for(int i=1; i<=n; i++){
        cin>>haz[i];
        if(haz[i-1]>haz[i] && i!=1) haz[i]=haz[i-1];
    }
    for(int i=1; i<=m; i++){
        long long int t;
        cin>>t;
        int e=1; int v=n;
        while(e!=v){
            int mi=(e+v)/2;
            if(haz[mi]<t) e=mi+1;
            else v=mi;
        }
        if(haz[e]==t) cout<<e+1<<endl;
        else cout<<e<<endl;
    }
}