#include <iostream>
#include <algorithm>

#include <set>
using namespace std;

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

    multiset<long long> tickets;
    for (int i = 0; i < n; i++) {
        long long x;
        cin >> x;
        tickets.insert(x);
    }



    int ta = n;

    for (int i = 0; i < m; i++) {
        long long x;
        cin >> x;


    multiset<long long>::iterator it = tickets.lower_bound(x + 1);

        if(it == tickets.begin()) {
            cout << -1 << "\n";

        }
        else {
            it--;
            cout << *it << "\n";
            tickets.erase(it);
        }





        }


    return 0;
}