#include <bits/stdc++.h>
#include <cmath>

#define  fl(i,a,b) for(long long i=a;i<b;i++)
#define  test long long t_c;cin>>t_c;for(long long ks=1;ks<=t_c;ks++)
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define cy cout<<"YES\n";
#define cn cout<<"NO\n";
#define nl cout<<endl;
#define case(x) cout<<"Case "<<x<<": ";



typedef long long ll;
typedef long long int lli;
void sc(int &x){scanf("%d",&x);}
void sc(lli &x){scanf("%lld",&x);}
void sc(char *x){scanf("%s",x);}
void sc(double &x){scanf("%lf",&x);}

using namespace std;
int main()
{
   ios_base::sync_with_stdio(false);
   lli a,b;
   cin>>a>>b;
   if(abs(a-b)<3)
   {
       cout<<"Yes\n";
   }
   else
   {
       cout<<"No\n";
   }


}

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
  int n,q;cin>>n>>q;
  vector<ll>a(n);
  for(int i=0;i<n;i++)cin>>a.at(i);
  sort(a.begin(),a.end());
  for(int i=0;i<q;i++){
    ll k;cin>>k;
    ll old=(ll)(lower_bound(a.begin(),a.end(),k+1)-a.begin());
    ll kk=k+old;
    ll now=(ll)(lower_bound(a.begin(),a.end(),kk+1)-a.begin());
    while(now!=old){
      kk=k+now;
      old=now;
      now=(ll)(lower_bound(a.begin(),a.end(),kk+1)-a.begin());
    }
    cout<<kk<<endl;
  }
}