#include<bits/stdc++.h>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ar array
#define vi vector
#define bit(i,x) ((x >> i) & 1ll)
#define all(x) x.begin(),x.end()
#define low(l,r,x) x.begin()+l,x.begin()+r
#define len(l,r) (r-l+1)
#define PI acos(-1.0)
const long long mod = 1e9+7, N = 3000, INF = 1e18, Log = 19, MASK = 1 << 19;
template <class T> void setmin(T &a, T b) { if(b < a) a = b; }
template <class T> void setmax(T &a, T b) { if(b > a) a = b; }
template <class T> void add(T &a, T b) {a += b; if(a >= mod) a -= mod;}
using namespace std;
#define int long long
ll dp[22][1 << 22];
unordered_map<ll,vi<ll>> mp;
void kazuha() {
ll n , m;
cin >> n >> m;
ll a[n+5] , b[m+5];
for(int i = 1; i <= n;i++) {
cin >> a[i];
}
for(int j =1; j <= m;j++) {
cin >> b[j];
}
ll s = (1 << m);
for(int i = 0; i < s;i++) {
ll cur = 0;
for(int j = 0; j < m;j++) {
if(bit(j, i)) cur += b[j];
}
mp[cur].push_back(i);
}
for(int i = 0; i < s;i++) dp[0][i] = 1;
for(int i = 1; i <= n;i++) {
for(int j = 0; j < s;j++) {
for(auto k : mp[a[i]]) {
if((j | k) == j)
dp[i][j] |= dp[i-1][j ^ k];
}
}
}
cout << ((dp[n][s-1] == 1) ? "YES" : "NO") << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("permutation.cpp", "r", stdin);
// freopen("permutation.cpp", "w", stdout);
long long mitsu = 1;
// cin >> mitsu;
for(long long seele = 0; seele < mitsu;seele++) {
// cout << "Case " << seele << " :";
kazuha();
}
}
