#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
void solve(){
int n, m; cin >> n >> m;
vector <int> a(n), b(m);
for (auto &e : a) cin >> e;
for (auto &e : b) cin >> e;
sort(all(a));
sort(all(b));
vector <pii> dp(1 << m, {-1, 0});
// dp[mask] = max person that we can do,
// left[mask] = leftover money from doing until dp[mask]
for (int mask = 1; mask < (1 << m); mask++) {
for (int i = 0; i < m; i++) {
if (!(mask & (1 << i))) continue;
int pmask = mask ^ (1 << i);
if (dp[pmask].second + b[i] == a[dp[pmask].first + 1]) dp[mask] = max(dp[mask], {dp[pmask].first + 1, 0});
else dp[mask] = max(dp[mask], {dp[pmask].first, dp[pmask].second + b[i]});
}
if (dp[mask].first == n - 1) return cout << "YES\n", void();
}
cout << "NO\n";
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
