#include<bits/stdc++.h>
using namespace std;
int a[100005];
int n,m,f=0;
void dfs(int num,int sum,int val){
if(sum==val){
f=1;
return;
}
if(num>=n) return;
dfs(num+1,sum+a[num],val);
dfs(num+1,sum-a[num],val);
dfs(num+1,sum,val);
}
int main(){
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i];
while(m--){
int val;cin>>val;
f=0;
dfs(0,0,val);
if(f) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
11-26
832
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-06
1150
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-23
3182
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)