#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define bit(mask, i) ((mask >> i) & 1)
#define el '\n'
#define F first
#define S second
template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};
const int maxn = 25;
const int lim = (1 << 20);
int n, m, p[maxn], b[maxn], f[lim], l[lim];
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> p[i];
for (int i = 1; i <= m; ++i)
cin >> b[i];
memset(f, -1, sizeof(f));
memset(l, -1, sizeof(l));
f[0] = l[0] = 0;
for (int mask = 0; mask < (1 << m); ++mask)
for (int i = 0; i < m; ++i) {
if (!bit(mask, i)) continue;
int pref = mask ^ (1 << i);
if (f[pref] == -1) continue;
int new_amt = l[pref] + b[i + 1];
int targ = p[f[pref] + 1];
if (new_amt < targ) {
f[mask] = f[pref];
l[mask] = new_amt;
} else if (new_amt == targ) {
f[mask] = f[pref] + 1;
l[mask] = 0;
}
if (f[mask] == n) return cout << "YES", void();
}
cout << "NO";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (!MULTI) solve();
else {
int test; cin >> test;
while (test--) solve();
}
return 0;
}
