#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<int> tickets(n), customers(m);
    for(int i = 0; i < n; ++i) {
        cin >> tickets[i];
    }
    for(int i = 0; i < m; ++i) {
        cin >> customers[i];
    }
    sort(tickets.begin(), tickets.end());
    for(int i = 0; i < m; ++i) {
        int left_bound = 0;
        int right_bound = (int) tickets.size() - 1;
        int it = -1;
        while(left_bound <= right_bound) {
            int middle = (left_bound + right_bound) / 2;
            if(tickets[middle] > customers[i]) {
                right_bound = middle - 1;
            }
            else {
                left_bound = middle + 1;
                it = middle;
            }
        }
        if(it != -1) {
            cout << tickets[it] << "\n";
            tickets.erase(tickets.begin() + it);
        }
        else {
            cout << -1 << "\n";
        }
    }

    return 0;
}