// Source: https://usaco.guide/general/io

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

int main() {
	int n , q; cin >> n >> q;
    vector<int> a;
    int u = 0;
    for(int i = 0; i < n; i++){
        int x; cin >> x;
        u = max(u , x);
        a.push_back(u);
    }
    while(q--){
        int o; cin >> o;
        cout << upper_bound(a.begin() , a.end(), o)-a.begin()+1<<"\n";
    }
}