#include <iostream>
#include <algorithm>


using namespace std;

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

    long long tickets[200000];
    for (int i = 0; i < n; i++) {
        cin >> tickets[i];
    }


    sort(tickets, tickets + n);

    int ta = n;

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

        int left = 0, right = ta - 1;
        int pos = -1;


        while (left <= right) {
            int mid = (left + right) / 2;

            if (tickets[mid] <= x) {
                pos = mid;
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        if (pos == -1) {
            cout << -1 << '\n';
        } else {
            cout << tickets[pos] << '\n';


            for (int j = pos; j < ta - 1; j++) {
                tickets[j] = tickets[j + 1];
            }
            ta--;
        }
    }

    return 0;
}