#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
const ll INF = numeric_limits<ll>::max();
const int inf = numeric_limits<int>::max();
const char nl = '\n', sp = ' ';
ll cantor_hash(ll x, ll y){
ll ans = (((x + y) * (x + y + 1)) >> 1) + y;
// cout << ans << nl;
return ans;
}
unordered_map<ll,bool> vis;
bool f(int id, ll mask, ll val, int N, vector<ll> &salary, vector<ll> &billz ){
if(vis.count(cantor_hash(mask,val))){
return vis[cantor_hash(mask,val)];
} else {
if(id == N){
return true;
} else if(val == 0){
return f(id + 1,mask,salary[id + 1], N, salary, billz);
} else {
bool flag = false;
for(int i = 0; i < N; i++){
if((mask & (1 << i)) != 0){
if(val - billz[i] >= 0){
flag = flag | f(id, mask ^ (1 << i),val - billz[i],N, salary,billz);
// flag = true;
} else {
break;
}
}
}
vis[cantor_hash(mask,val)] = flag;
return flag;
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<ll> salary;
vector<ll> billz;
ll num;
for(int i = 0; i < N; i++){
cin >> num;
salary.push_back(num);
}
for(int i = 0; i < M; i++){
cin >> num;
billz.push_back(num);
}
sort(billz.begin(),billz.end());
ll mask = (1 << M) - 1;
bool ans = f(0,mask,salary[0], N ,salary, billz);
if(ans){
cout << "YES" << nl;
} else {
cout << "NO" << nl;
}
}
