#include<iostream>
#include<vector>
using namespace std;
int find(vector<long long int>& nums, long long int target);
int main(void)
{
    long long int n, m;
    vector<long long int> nums;
    long long int target;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        int temp;
        cin >> temp;
        nums.push_back(temp);
    }
    for (int i = 0; i < m; i++)
    {
        cin >> target;
        int finds = find(nums, target);
        if(finds > 0)
            while (nums[finds - 1] == nums[finds])
                finds--;
        cout << finds + 1 << " ";
    }
    return 0;
}
int find(vector<long long int>& nums, long long int target)
{
    int left = 0;
    int right = nums.size() - 1;
    while (left <= right)
    {
        int mid = (left + right) / 2;
        if (nums[mid] == target)
            return mid;
        else if (nums[mid] > target)
            right = mid - 1;
        else
            left = mid + 1;
    }
    return -2;
}