#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using namespace chrono;
template<typename T> using ordered_set = tree<T, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(a) (a).begin(), (a).end()
int dp[1 << 20], mleft[1 << 20];
int a[20], b[20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n,m; cin >> n >> m;
for (int i = 0; i < n; cin >> a[i++]);
for (int i = 0; i < m; cin >> b[i++]);
for (int mask = 1; mask < 1 << m; mask++) {
pair<int,int> best = {-1, -1};
for (int i = 0; i < m; i++) if ((mask >> i) & 1) {
int cur_people = dp[mask ^ (1 << i)];
int cur_left = mleft[mask ^ (1 << i)];
if (cur_left + b[i] == a[cur_people])
cur_left = 0, cur_people++;
else if (cur_left + b[i] < a[cur_people])
cur_left += b[i];
best = max(best, {cur_people, cur_left});
}
tie(dp[mask], mleft[mask]) = best;
// cout << mask << " " << dp[mask] << " " << mleft[mask] << "\n";
if (dp[mask] == n) {
cout << "YES\n";
return 0;
}
}
cout << "NO";
}
