# Concert Tickets

There are $n$ concert tickets available, each with a certain price. Then, $m$ customers arrive, one after another.

Each customer announces the maximum price they are willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price.

Input

The first input line contains integers $n$ and $m$: the number of tickets and the number of customers.

The next line contains $n$ integers ${h}_{1},{h}_{2},\dots ,{h}_{n}$: the price of each ticket.

The last line contains $m$ integers ${t}_{1},{t}_{2},\dots ,{t}_{m}$: the maximum price for each customer in the order they arrive.

Output

Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again.

If a customer cannot get any ticket, print $-1$.

Constraints
• $1\le n,m\le 2\cdot {10}^{5}$
• $1\le {h}_{i},{t}_{i}\le {10}^{9}$
Example

Input:
5 35 3 7 8 54 8 3

Output:
38-1

#include <bits/stdc++.h>using namespace std;#define int            long long int#define F              first#define S              second#define pb             push_back#define si             set <int>#define vi             vector <int>#define pii            pair <int, int>#define vpi            vector <pii>#define vpp            vector <pair<int, pii>>#define mii            map <int, int>#define mpi            map <pii, int>#define spi            set <pii>#define endl           "\n"#define sz(x)          ((int) x.size())#define all(p)         p.begin(), p.end()#define double         long double#define que_max        priority_queue <int>#define que_min        priority_queue <int, vi, greater<int>>#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)#define print(a)       for(auto x : a) cout << x << " "; cout << endl#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endlinline int power(int a, int b){  int x = 1;  while (b)  {    if (b & 1) x *= a;    a *= a;    b >>= 1;  }  return x;}template <typename Arg1>void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }template <typename Arg1, typename... Args>void __f (const char* names, Arg1&& arg1, Args&&... args){  const char* comma = strchr (names + 1, ',');  cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);}const int N = 200005;void solve() {int n,m;cin>>n>>m;multiset<int>v;for (int i = 0; i < n; i++){    int x;    cin>>x;    v.insert(x);}for (int i = 0; i < m; i++){    int x;    cin>>x;    auto it=v.upper_bound(x);    if(it==v.begin()){        cout<<-1<<endl;    }    else{        --it;        cout<<*it<<endl;        v.erase(it);    }}}int32_t main(){  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);  clock_t z = clock();  int t = 1;//   cin >> t;   while (t--) solve();  return 0;}