#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 1e5 + 5;
int n, Q, a[N], q[N], id[N], ans[N];
bool cmp (int a, int b) {
	return q[a] < q[b];
}
signed main () {
	cin >> n >> Q;
	rep(i, 1, n) cin >> a[i];
	a[++n] = 3e18;
	rep(i, 1, Q) cin >> q[i], id[i] = i;
	sort(id + 1, id + Q + 1, cmp);
	for (int i = 1, j = 1, cnt = 0; i <= Q; ++i) {
		for (; cnt < q[id[i]] && j <= n; ++j) cnt += a[j] - a[j - 1] - 1;
		ans[id[i]] = a[j - 1] - (cnt - q[id[i]]) - 1;
	}
	rep(i, 1, Q) cout << ans[i] << endl;
	return 0;
}
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int n = 4;
  vector<int> a(n);
  rep(i, n) cin >> a.at(i);
  int sum = accumulate(ALL(a), 0);
  rep(i, n){
    if(a.at(i) == sum - a.at(i)){
      cout << "Yes" << endl;
      return 0;
    }
    rep2(j, i+1, n){
      if(a.at(i) + a.at(j) == sum - a.at(i)-a.at(j)){
        cout << "Yes" << endl;
        return 0;
      }
    }
  }
  cout << "No" << endl;
  return 0;
}