#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;
using ll = long long;

signed main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, q;
	cin >> n >> q;
	vector<int> houses(n);
	for (int i = 0; i < n; i++) cin >> houses[i];

	vector<array<int, 2>> h; //ascending in heights by leaving out elements {height, origIdx}
	h.reserve(n);
	h.push_back({houses[0], 0});
	for (int i = 1; i < n; i++) {
		if (houses[i] <= h.back()[0]) continue;
		h.push_back({ houses[i], i });
	}

	while (q--) {
		int m;
		cin >> m;
		array<int, 2> v = { m, INT_MAX };
		cout << lower_bound(h.begin(), h.end(), v).operator*()[1] + 1;
	}
}