#include "bits/stdc++.h"
using namespace std;
int n,m,a[25],b[25],f[1001],cur[1001];
unordered_map<int,bool>memo;
bool sol(int i,int used){
if(i==n)return 1;
if(memo.find((i<<20)|used)!=memo.end())return memo[(i<<20)|used];
for(int mask=0;mask<(1<<m);mask++){
int sum=0;
if((mask&used)>0)continue;
for (int j=0;j<m;j++){
if((mask>>j)&1)sum+=b[j];
}
if(sum==a[i]&&sol(i+1,used|mask))return memo[(i<<20)|used]=1;
}
return memo[(i<<20)|used]=0;
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
cout<<(sol(0,0)?"YES":"NO");
}
