#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

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

    vector<int> prices(n), custumers(m);
    map<int, int> cnt;

    for (int i = 0; i < n; ++i) {
        scanf("%d", &prices[i]);
        cnt[prices[i]]++;
    }
    for (int i = 0; i < m; ++i) {
        scanf("%d", &custumers[i]);
    }

    vector<int> a;
    for (auto x : cnt) {
        a.push_back(x.first);
    }

    for (int pc = 0; pc < m; ++pc) {
        auto tmp = lower_bound(a.begin(), a.end(), custumers[pc]);

        while (tmp >= a.begin() && (cnt[*tmp] == 0 || *tmp > custumers[pc])) {
            tmp--;
        }

        if (tmp >= a.begin()) {
            cout << *tmp << endl;
            cnt[*tmp]--;
        } else {
            cout << -1 << endl;
        }
    }

    return 0;
}