#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(n + 1), b(m);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<int> pref(n + 1);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + a[i];
}
int ALL = 1 << m;
vector<int> sum(ALL);
for (int mask = 1; mask < ALL; mask++) {
int bit = __builtin_ctz(mask);
sum[mask] = sum[mask ^ (1 << bit)] + b[bit];
}
vector<char> dp(ALL, 0);
dp[0] = 1;
for (int mask = 0; mask < ALL; mask++) {
if (!dp[mask]) continue;
int cur = sum[mask];
int person = upper_bound(pref.begin(), pref.end(), cur) - pref.begin() - 1;
if (person == n) continue;
int taken = cur - pref[person];
for (int j = 0; j < m; j++) {
if (!(mask & (1 << j))) {
if (taken + b[j] <= a[person + 1]) {
dp[mask | (1 << j)] = 1;
}
}
}
}
if (dp[ALL - 1] && sum[ALL - 1] == pref[n]) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
