#include <algorithm>
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x); cerr << "\033[0m";
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
void solve() {
    int n, m;
    cin >> n >> m;

    vi a(n), b(m);
    for(auto &z : a) cin >> z;
    for(auto &z : b) cin >> z;

    sort(all(a));

    auto ima = [&](int x) {
        auto it = lower_bound(all(a), x);
        if(it == a.end() || *it != x) return 0;

        int poc = it - a.begin();
        it = upper_bound(all(a), x);
        --it;
        int kraj = it - a.begin();
        return kraj - poc + 1;
    };

    auto manje = [&](int x) {
        auto it = lower_bound(all(a), x);

        if(it == a.begin()) return 0;
        --it;
        int ima = it - a.begin();
        return ima + 1;
    };

    for(int iter = 0; iter < m; ++iter) {
        int x = b[iter];
        int manjeX = manje(x);
        int imaX = ima(x);

        int l = 0, r = 3 * n;
        int ans = -1;

        while(l <= r) {
            int mid = (l + r) / 2;
            int novoX = imaX + mid;

            if(novoX == 0) {
                l = mid + 1;
                continue;
            }

            int novaDuzina = n + mid;

            int izraz = (novaDuzina / 2) + 1;

            bool proveri = (manjeX < izraz && (manjeX + novoX) >= izraz);

            if(proveri) {
                ans = mid;
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }

        cout << ans << nl;
    }
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    // cin >> testCases;
    while(testCases--)
        solve();
}