#include<unordered_map>
#include<unordered_set>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<cassert>
#include<numeric>
#include<vector>
#include<string>
#include<chrono>
#include<random>
#include<stack>
#include<queue>
#include<cmath>
#include<set>
#include<map>
#include<ios>
using namespace std;
int n, m;
map<int, bool>vs;
vector<int>a, b;
vector<vector<int>>gp;
bool dfs(int id, int vis) {
if (id == n) return true;
vs[vis] = true;
for (int& x : gp[a[id]]) {
if (((vis & x) != x) || vs[vis ^ x])continue;
if (dfs(id + 1, vis ^ x)) return true;
}
return false;
}
void solve()
{
cin >> n >> m;
a = vector<int>(n);
b = vector<int>(m);
gp = vector<vector<int>>(1e3 + 1);
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
for (int i = 0; i < (1 << m); i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
if ((1 << j) & i) sum += b[j];
}
if (sum > 1e3) continue;
gp[sum].push_back(i);
}
cout << (dfs(0, (1 << m) - 1) ? "YES" : "NO");
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("bank.in", "r", stdin);
//freopen("bank.out", "w", stdout);
//signed _; cin >> _; while (_--)
solve();
}
