#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> a, b, as, bs, dp;
int solve(int c) {
if (dp[c] != -1) return dp[c];
int &ret = dp[c];
ret = 0;
for (int i = 0; i < m; i++) {
if (not (c & (1 << i))) continue;
int j = solve(c - (1 << i));
if (j >= n or bs[c] < as[j + 1]) ret = max(ret, j);
else if (bs[c] == as[j + 1]) ret = max(ret, j + 1);
}
return ret;
}
int main() {
cin >> n >> m;
a.resize(n + 1, 0), as.resize(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
as[i] = a[i] + as[i - 1];
}
b.resize(m), bs.resize(1 << m, 0);
for (int i = 0; i < m; i++) {
cin >> b[i];
for (int c = 0; c < (1 << m); c++) {
if (c & (1 << i)) bs[c] += b[i];
}
}
dp.resize(1 << m, -1);
cout << (solve((1 << m) - 1) >= n ? "YES" : "NO") << '\n';
return 0;
}
