#include <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    long long i,j,l,q,t,m,n,h,p;
    long long k,z,p1,h1,x,y;
    string st="",st1="";
    t = 1;
    while(t--)
    {
        std::cin >> n >> q;
        std::vector<long long> a;
        for(i=0;i<n;i++)
        {
            std::cin >> x;
            a.push_back(x);
        }
        while(q--)
        {
            std::cin >> k;
            long long y = 0,ans = k;
            while(true)
            {
                long long x = lower_bound(a.begin(),a.end(),ans)-a.begin();
                if(a[x] == ans)
                    x++;
                if(y == x)
                    break;
                ans = k+x;
                y = x;
            }
            cout << ans << endl;
        }
    }
    return 0;
}
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h> 
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
ll mod = 1000000007;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 

void solve()
{
    ll n,q,d;
    cin>>n>>q;
    ll a[n+1];
    ll sd[n+2];
    a[0] = 0;
    sd[0] = 0;
    sd[n+1] = LLONG_MAX;
    for(int i=1;i<n+1;i++)
    {
        cin>>a[i];
        d = a[i] - a[i-1] - 1;
        sd[i] = d + sd[i-1];
        //cout<<sd[i]<<" ";
    }
    //cout<<sd[n+1];
    cout<<'\n';
    for(int i=0;i<q;i++)
    {
        ll k;
        cin>>k;
        auto it = lower_bound(sd,sd+n+1,k);
        auto ind = (it - sd); 
        //cout<<ind<<" ";
        ll ans = a[ind-1] + k - sd[ind-1];
        cout<<ans<<'\n';
        // for(int j=0;j<n;j++)
        // {
        //     d = a[j+1] - a[j] - 1;
        //     if(k > d)
        //     {
        //         k -= d;
        //     }
        //     else
        //     {
        //         ll ans = a[j] + k;
        //         cout<<ans<<'\n';
        //         break;
        //     }
        // }
    }
}
int main()
{
    solve();
    return 0;
}