#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ar array
const int MOD = 1e9 + 7,INF = 1e18, N = 2e5 + 5;
/*
5 2
1 2 2
2 3 2
3 4 2
4 5 2
*/
void solve(){
int n , m;
cin >> n >> m;
vector <int> a(n) , b(m);
vector <vector <int>> dp(n , vector <int> (1 << m));
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < m;i++){
cin >> b[i];
}
map <int, vector <int>> mp;
for(int i = 0;i < (1 << m);i++){
int sum = 0;
for(int j = 0;j < m;j++){
if(1 & (i >> j)){
sum += b[j];
}
}
mp[sum].pb(i);
}
set <int> g;
for(int i : mp[a[0]]){
dp[0][i] = 1;
g.insert(i);
}
for(int i = 1;i < n;i++){
set <int> cnt;
for(int j : mp[a[i]]){
for(int k : g){
if((k & j) == 0){
dp[i][(k | j)] = 1;
cnt.insert(k | j);
}
}
}
swap(cnt , g);
}
int f = 0;
for(int i = 0;i < (1 << m);i++){
if(dp[n - 1][i]){
f = 1;
}
}
if(f){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int ti = 1;
while (ti--) {
solve();
}
}
