#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define getar(ar,n) for(ll i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define all(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ret return
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
const int mxN = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
ll ar[30],p[30];
void solve(ll tc) {
ll n,m;cin>>n>>m;
for(ll i=0;i<n;++i) cin>>ar[i];
for(ll i=0;i<m;++i) cin>>p[i];
for(ll i=0;i<=(1ll<<m);++i){
ll t=0;
for(ll j=0;j<m;++j){
if(i&(1ll<<j)) t+=p[j];
}
if(t==ar[0]) {yes;return;}
}
no;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve(0);
return 0;
}
