#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e1+2,K=(1<<20)+5,A=1e3+5;
bitset<K>dp[N];
int a[N],b[N];
vec<int>su[A];
int iter=1,itera=1;
void solve(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
for(int j=0;j<(1<<m);j++){
int s=0;
for(int i=0;i<m;i++){
if(j&(1<<i)) s+=b[i];
}
if(s<A) su[s].push_back(j);
}
dp[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=dp[i-1]._Find_first();j<(1<<m);j=dp[i-1]._Find_next(j)){
for(int k:su[a[i]]){
if((j&k)==0)
dp[i][k|j]=1;
}
}
}
if(dp[n].any()) cout<<"YES\n";
else cout<<"NO\n";
}
signed main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(20);
// cin>>itera;
for(iter=1;iter<=itera;iter++) solve();
}
