#include <iostream>
#include <vector>

void query(std::vector<int> v, int x) {
    int n = v.size();
    int l = 0, r = n - 1;
    while (l != r) {
        int m = (l + r) / 2;
        if (x <= v[m]) {
            r = m;
        } else { // x > v[m], x ? v[m+1]
            l = m + 1;
        }
    }
    if (x <= v[0] || x > v[n-1]) {
        std::cout << v[l] << '\n';
    } else if ( v[l] - x >= x - v[l - 1]) {
        std::cout << v[l - 1] << '\n';
    } else {
        std::cout << v[l] << '\n';
    }
}

int main() {
    int n, k;
    std::cin >> n >> k;
    std::vector <int> v(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> v[i];
    }
    for (int i = 0; i < k; ++i) {
        int x;
        std::cin >> x;
        query(v, x);
    }
}