#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mod 998244353
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
vector<int>v(n),vv(m);
for(auto &i:v)cin>>i;
for(auto &i:vv)cin>>i;
sort(v.begin(),v.end());
bool ans=1;
for(auto &ii:v){
bool temp=0;
for(int i=0;i<(1<<vv.size());i++){
int a=0;
for(int w=0;w<vv.size();w++){
if(i&(1<<w)){
a+=vv[w];
}
}
if(a==ii){
vector<int>vvv;
for(int w=0;w<vv.size();w++){
if(i&(1<<w)){
}else vvv.push_back(vv[w]);
}
vv=vvv;
temp=1;
break;
}
}
if(!temp){
ans=0;
break;
}
}
cout<<(ans?"YES":"NO");
}
