#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
bool maximize (T1 &a, T2 b) {
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize (T1 &a, T2 b) {
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void clear_dup (vector<T> &a) {
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
typedef long long ll;
typedef pair <int, int> ii;
typedef vector <int> vi;
#define FOR(i, a, b) for(int i = a; i <= (int)b; i++)
#define FORD(i, a, b) for(int i = a; i >= (int)b; i--)
#define MASK(i) (1LL << (i))
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
const int N = 3e5 + 5;
int n, m;
int a[N], b[N];
bool dp[25][MASK(20) + 1];
void process(void) {
cin >> n >> m;
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, m) cin >> b[i];
queue <array <int, 2>> que;
FOR(mask, 0, MASK(m) - 1) {
int sum = 0;
FOR(i, 1, m) if (BIT(mask, i - 1)) sum+= b[i];
if (sum == a[1]) {
dp[1][mask] = 1;
que.push({1, mask});
}
}
while (!que.empty()) {
int id = que.front()[0], mask = que.front()[1];
que.pop();
if (id == n) {
cout << "YES";
return;
}
FOR(nxt_mask, 0, MASK(m) - 1) {
bool ok = true;
FOR(i, 1, m) if (BIT(nxt_mask, i - 1) && BIT(mask, i - 1)) {
ok = false;
}
if (ok == false) continue;
int sum = 0;
FOR(i, 1, m) if (BIT(nxt_mask, i - 1)) sum+= b[i];
if (sum == a[id + 1]) {
dp[id + 1][nxt_mask | mask] = 1;
que.push({id + 1, nxt_mask});
}
}
}
cout << "NO";
}
int main(void) {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define taskname "kieuoanh"
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
process();
cerr << "\n[Time elapsed] " << clock() << " ms!\n";
return 0;
}
