#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <iomanip>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <map>
#define ll long long
#define X first
#define Y second
#define endl '\n'
using namespace std;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
vector<int> p;
vector<int> b;
int n, m;
void read()
{
cin >> n >> m;
p.resize(n);
b.resize(m);
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
for (int i = 0; i < m; i++)
{
cin >> b[i];
}
}
const int MAXN = 20100;
vector<int> dp[MAXN + 5];
struct state
{
int sum, i;
vector<bool> used;
state()
{
sum = i = 0;
used.assign(20, 0);
}
bool operator<(const state &x) const
{
if (i != x.i)
return i < x.i;
if (sum != x.sum)
return sum < x.sum;
for (int i = 0; i < 20; i++)
{
if (used[i] != x.used[i])
return used[i] < x.used[i];
}
return false;
}
state operator+(int idx)
{
state res;
res.i = i;
res.sum = sum-b[idx];
res.used = used;
res.used[idx] = 1;
return res;
}
};
map<state, bool> s;
bool rec(state x)
{
if (s.count(x))
return s[x];
if (x.i == n)
{
s[x] = 1;
return true;
}
if (x.sum == 0)
{
state ne = x;
ne.used = x.used;
ne.i = x.i + 1;
ne.sum = p[ne.i];
bool res = rec(ne);
s[x] = res;
return res;
}
for (int p : dp[x.sum])
{
if (!x.used[p])
{
if (rec(x + p))
{
s[x]=1;
return true;
}
}
}
s[x]=0;
return false;
}
signed main()
{
speed();
read();
dp[0].push_back(-1);
for (int i = 0; i < m; i++)
{
for (int j = MAXN; j >= 0; j--)
{
if (dp[j].size())
{
dp[j + b[i]].push_back(i);
}
}
}
state x;
x.i = 0;
x.sum = p[0];
if (rec(x))
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
return 0;
}
