#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define vll vector<long long>
#define vpll vector< pair<long long int , long long int > >
#define rep(i,x,a) for (long long i=x; i<a; i++)
#define si(x) (long long int)x.size()
#define pb push_back
#define ff first
#define ss second
#define lg2(x) (long long int)log2(x)
#define gap " "
#define nl '\n'
#define all(x) (x).begin(),(x).end()
#define no cout<<"NO\n"
#define yes cout<<"YES\n"
#define vld vector<long double>
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
void print(){
cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){
cout << a;
(cout << ... << (cout << ' ', b));
cout << '\n';
}
template<class... T>
void input(T&... a){
(cin >> ... >> a);
}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MOD=1e9+7;
const int N=1e6+10;;
const ll INF=1e16;
const long long int LINF=LLONG_MAX;
/*------------------------------------*/
void solve(int tc = 0)
{
ll n,m;input(n,m);
map<ll,vector<ll>> mp;
rep(i,0,n){ll x;cin >> x;mp[x].pb(i);}
vll a(m);rep(i,0,m)cin >> a[i];
vector<pair<ll,ll>> dp(1ll<<m,{0ll,0ll});
for(int i=0;i<(1LL<<m);i++){
for(int j=0;j<m;j++){
if(!(i&(1<<j))){
ll sum = dp[i].second + a[j];
if(__builtin_popcount(dp[i|(1LL<<j)].first) <= __builtin_popcount(dp[i].first))
dp[i|(1LL<<j)].first = dp[i].first;
dp[i|(1<<j)].second = sum;
if(mp[sum].size() > 0){
for(auto el:mp[sum]){
if(__builtin_popcount(dp[i|(1LL<<j)].first) <= __builtin_popcount(dp[i].first|(1<<el))){
dp[i|(1LL<<j)].first = dp[i].first|(1LL<<el);
dp[i|(1LL<<j)].second = 0;break;
}
}
}
}
}
}
debug(dp);
if((dp[(1LL<<m)-1].first) == (1LL<<n)-1){
yes;
}
else{
no;
}
}
/*------------------------------------*/
int main()
{
#ifndef ONLINE_JUDGE
freopen("Error.txt","w",stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
ll tc=1;
for(int i=0 ; i < tc ; i++)
{
solve(i);
}
return 0;
}
