#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e6+3;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int testcase_number){
cin>>n>>m;
// dp[k][i] take element with mask k to pay first i
// dp[k][i] = dp[k'][i-1] and sum of extra bank notes = a[i];
// dp[0][0] = 1;
// ans = dp[all pos k ][n];
int A[n];
int BK[m];
for(int i =0 ;i<n;i++){
cin>>A[i];
}
for(int i = 0;i<m;i++){
cin>>BK[i];
}
int dp[(1<<m) +10][n+1];
for(int i = 0;i<=n;i++){
for(int j = 0;j<=(1<<m);j++){
dp[j][i] = 0;
}
}
dp[0][0] = 1;
for(int mask = 1;mask<(1<<m);mask++){
int sum = 0;
// string s;
for(int j = 0;j<m;j++){
if(mask&(1<<j)){
sum+=BK[j];
// s+='1';
}
else{
// s+='0';
}
}
for(int j = 1;j<=n;j++){
for(int submask = 0;submask<(1<<m);submask++){
if((submask & mask) != submask)continue;
int sum1 = 0;
for(int ki = 0;ki<m;ki++){
if((submask&(1<<ki)) ){
// s+='1';
sum1+=BK[ki];
}
else{
// s+='0';
}
}
if(sum-sum1 == A[j-1] and dp[submask][j-1] ){
dp[mask][j] = 1;
break;
}
}
}
}
for(int mask = 0;mask<(1<<m);mask++){
if(dp[mask][n]){
// cout<<i<<endl;
cout<<"YES"<<endl;
return;
}
}
cout<<"NO"<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
