#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define all(x) x.begin(), x.end()
using namespace std;
template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}
const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 20;
const int oo = 1e9 + 69;
int n, m, a[maxn], b[maxn];
pa dp[1 << maxn];
bool getbit(const int mask, int i) {
return ((mask >> i) & 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen(TASK".inp", "r", stdin);
//freopen(TASK".out", "w", stdout);
cin>>n>>m;
for(int i = 0; i < n; i++) cin>>a[i];
for(int i = 0; i < m; i++) cin>>b[i];
fill_n(dp, (1 << m), make_pair(-1, 0));
dp[(1 << m) - 1] = {0, 0};
for(int mask = (1 << m) - 1; mask; mask--)
if(dp[mask].fi != -1)
for(int x = mask; x; x -= x&-x) {
int i = dp[mask].fi, j = __builtin_ctz(x), s = dp[mask].se + b[j], cur = (mask ^ (1 << j));
if(s < a[i]) {
dp[cur] = {i, s};
} else if(s == a[i]) {
dp[cur] = {i + 1, 0};
}
if(dp[cur].fi == n) {
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
}
