#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll int
#define F first
#define S second
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int N = 2000001;
using namespace std;
using namespace __gnu_pbds;
ll n, m, p[N], f[N], a, used[21][N];
vector <ll> g[N];
vector <ll> res;
void rec (ll pos, ll mask){
if (pos == n + 1){
// for(auto x : res) cout << x << " ";
cout << "YES";
exit(0);
}
if (used[pos][mask]){
return;
}
used[pos][mask] = 1;
for (auto i: g[p[pos]]){
if ((mask & i) == 0){
// res.pb(i);
rec (pos + 1, (mask | i));
// res.pop_back();
}
}
}
signed main (){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++){
cin >> p[i];
}
for (int i = 1; i <= m; i++){
cin >> f[i];
}
for (int y = 1; y < (1 << m); y++){
a = 0;
for (int j = 0; j < m; j++){
if ((y >> j) & 1){
a += f[j + 1];
}
}
if (a <= 1000){
g[a].pb(y);
}
}
rec(1,0);
cout << "NO";
}
