#pragma GCC optimize("O3,Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 200005;
ll a[N+2], b[N+2], dp[N+2], f[N+2];
vector<int> masks[N+2];
bool ok = 0;
int n, m;
void dfs(int mask, int idx){
if(idx == n){
ok = 1;
return;
}
if(ok)return;
for(auto &i : masks[a[idx]]){
if(!(mask & i)){
if(ok)return;
dfs(mask | i, idx + 1);
}
}
}
void solve(){
cin>>n>>m;
for(int i = 0; i < n; i++){
cin>>a[i];
f[a[i]]++;
}
for(int i = 0; i < m; i++){
cin>>b[i];
}
for(int i = 1; i <= (1 << m); i++){
int sum = 0;
for(int j = 0; j < m; j++){
if((i >> j) & 1)sum += b[j];
}
masks[sum].pb(i);
}
std::random_device rd;
for(int i = 1; i <= 20000; i++){
std::mt19937 g(rd());
shuffle(all(masks[i]), rd);
if(f[i] > masks[i].size()){
cout<<"NO";
return;
}
}
dfs(0, 0);
cout<<(ok ? "YES" : "NO");
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int tt = 1;
//cin>>tt;
while(tt--){
solve();
cout<<'\n';
}
}
