#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define sz(x) (int)x.size()
#define F first
#define S second
#define int long long
const int dx[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int dy[] = {1, 0, -1, 0, -1, 1, -1, 1};
const int maxn = 21;
const int N = 2e5+7;
const int inf = 1e18;
const int mod = 1e9+7;
using namespace std;
int n, m;
int a[maxn], b[maxn];
int dp[(1ll << maxn)][maxn];
vector<int> msk[N];
string trans(int n , int k){
string s = "";
while(n != 0){
int d = n % k;
if(d < 10){
s = to_string(d) + s;
}
else{
s = char(d + 'A' - 10) + s;
}
n /= k;
}
return s;
}
void solve(){
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
for(int mask = 1; mask < (1 << m); mask++){
int sum = 0;
for(int i = 0; i < m; i++){
if((mask & (1 << i))){
sum += b[i];
}
}
if(sum == a[0]) dp[mask][0] = 1;
msk[sum].pb(mask);
}
for(int mask = 1; mask < (1 << m); mask++){
// cout << trans(mask, 2) << '\n';
for(int i = 1; i < n; i++){
for(auto x : msk[a[i]]){
if((mask & x) == 0){
dp[(mask | x)][i] |= dp[mask][i - 1];
}
}
}
}
for(int mask = 1; mask < (1 << m); mask++){
if(dp[mask][n - 1]){
cout << "YES\n";
return;
}
}
cout << "NO\n";
}
signed main(){
speed
int test = 1;
// cin >> test;
while(test--){
solve();
}
}
