#include <bits/stdc++.h>
using namespace std;
const int Z = 20;
int N, M, A[Z], B[Z];
vector<int> S[Z];
set<int> dp[1<<Z]; // dp[s] : states of subset S
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> N >> M;
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < M; i++) cin >> B[i];
for (int state = 1; state < (1 << M); state++) {
int sum = 0;
for (int i = 0; i < M; i++) if (state & (1 << i)) sum += B[i];
for (int i = 0; i < N; i++) if (sum == A[i]) S[i].push_back(state);
}
//dp[0] = empty
for (int s = 1; s < (1<<N); s++)
{
for (int i = 0; i < N; i++)
{
if (!(s & (1<<i))) continue;
if (dp[s^(1<<i)].empty()) {
if (__builtin_popcount(s) == 1) dp[s].insert(S[i].begin(), S[i].end());
continue;
}
for (auto cur_state : S[i])
for (auto prev_state : dp[s^(1<<i)])
{
if (cur_state & prev_state) continue;
dp[s].insert(cur_state | prev_state);
}
}
if (!dp[(1<<N)-1].empty()) { // Early exit if found
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
