// Problem: Elevator Rides
// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std ;
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ones(x) __builtin_popcount(x)
#define remove(v) v.erase(unique(all(v)), v.end())
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define per(i, a, b) for(int i = a; i >= b; i--)
#ifdef local
#include "C:\debug.h"
#else
#define dbg(x...) 42
#endif
const int N = 2e6 + 2 ;
int n , m , a[21] , b[21] ;
vector<int> f[1001] ;
void go(int i , int mask) {
if(i > n) {
cout << "YES\n" ;
exit(0) ;
}
for(auto& x : f[a[i]]) {
bool ok = 1 ;
rep(i , 0 , 32) {
if((mask >> i & 1) == 1 && (x >> i & 1) == 1) {
ok = 0 ;
break ;
}
}
if(ok) {
go(i + 1 , (mask | x)) ;
}
}
}
void solve(){
cin >> n >> m ;
rep(i , 1 , n) cin >> a[i] ;
rep(i , 1 , m) cin >> b[i] ;
assert(n < 20 || m < 20) ;
rep(i , 1 , (1 << m) - 1) {
int cur = 0 ;
rep(mask , 0 , m - 1) {
if((i >> mask) & 1) {
cur += b[mask + 1] ;
}
}
if(cur <= 1000) {
f[cur].pb(i) ;
}
}
go(1 , 0) ;
cout << "NO" ;
}
int main () {
// ios::sync_with_stdio(false) ;
// cin.tie(0) ;
int test = 1 ;
// cin >> test ;
for(int i = 1 ; i <= test ; i++) {
solve() ;
}
}
