/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
#pragma ("reroint") */
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const int mod = 1e9 + 7,N = 11;
bool was[N];
int n,m;
int a[N],b[N];
bool ok = 0;
vector<int>v;
vector<int>vv;
void rec(int j){
if(j==n+1){
ok = 1;
return;
}
for(int msk = 0;msk<(1 << (v.size()));msk++){
int sum = 0;
for(int i = 0;i<v.size();i++){
if(!(msk & (1 << (i - 1)))) continue;
sum+=b[v[i]];
}
if(sum==a[j]){
vv.clear();
for(int i = 0;i<v.size();i++){
if(!(msk & (1 << (i - 1)))){
vv.pb(i);
}
}
swap(vv,v);
rec(j+1);
swap(vv,v);
}
}
}
signed main(){
//freopen("justcoding.in","r",stdin);
//freopen("justcoding.out","w",stdout);
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1;i<=n;i++) cin >> a[i];
for(int i = 1;i<=m;i++) {cin >> b[i];v.pb(i);};
rec(1);
if(ok) cout << "YES\n";
else cout << "NO\n";
}
