#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
const int N = 20;
int dp[1 << N][2];
int sal[N+5], notes[N+5];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
f0r(i, n) cin >> sal[i];
sort(sal, sal + n);
f0r(i, m) cin >> notes[i];
memset(dp, -1, sizeof dp);
dp[0][0] = dp[0][1] = 0;
fnr(s, 1, 1 << m) {
f0r(j, m) if ((s >> j) & 1) {
int sm = s ^ (1 << j);
int nm = dp[sm][0], lf = dp[sm][1] + notes[j];
if (nm == -1) continue;
if (lf < sal[nm] && nm > dp[s][0]) dp[s][0] = nm, dp[s][1] = lf;
else if (lf == sal[nm]) {
dp[s][0] = nm+1, dp[s][1] = 0;
break;
}
}
if (dp[s][0] == n) {
ctn("YES");
return 0;
}
}
ctn("NO");
}
