lwbd_binsrch_c++

#include "bits/stdc++.h"

#define pb push_back

using namespace std;

int main() {
    int n, k, t;
    vector <int> N, K;
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> t;
        N.pb(t);
    }
    for (int i = 0; i < k; i++) {
        cin >> t;
        K.pb(t);
    }
    for (auto i : K) {
        int l = 0, r = n-1, m;
        while (l != r) {
            m = (l+r)/2;
            N[m] < i ? l = 1 + m : r = m;
        }
        if (i != N[r] && r > 0 && !(abs(N[r-1]-i) > abs(N[r] - i))) cout << N[r-1] << endl;
        else cout << N[r] << endl;
    }
    return 0;
}