#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

int main()
{
    long long n, k, left, right, mid;
    cin >> n >> k;
    vector<long long> a(n);
    vector<long long> b(k);
    for (long long i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (long long i = 0; i < k; i++) {
        cin >> b[i];
    }
    for (long long i = 0; i < k; i++) {
        left = 0;
        right = n - 1;
        mid = (left + right) / 2;
        while (right - left > 1) {
            mid = (right + left) / 2;
            if (a[mid] > b[i]){
            right = mid;
            } else{
            left = mid;
            }
            }
            if (a[right] - b[i] >= b[i] - a[left]) {
                cout << a[left] << endl;
            } else {
                cout << a[right] << endl;
            }
    }
}