#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
const int N=21;
//const ll mod=998244353;
const ll mod=1000000007;
const int intinf=2e9;
const ll llinf=9e18;
const ld eps=2e-7;
int n, m, a[N], b[N];
int dp[(1 << N)][N];
ll calc(ll mask){
ll ans = 0;
for(int i = 0; i < m; i++){
if((mask & (1 << i)) != 0){
ans += b[i];
}
}
return ans;
}
void solve(){
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
int ans = 0;
for(int mask = 1; mask < (1 << m); mask++){
for(int submask = mask; submask != 0; submask = (submask - 1) & mask){
int subset = submask ^ mask;
if(calc(mask) == a[0]){
dp[mask][0] = 1;
}
for(int i = 1; i < n; i++){
if(calc(submask) == a[i]){
dp[mask][i] |= dp[subset][i - 1];
}
}
ans |= dp[mask][n - 1];
}
}
if(ans == 1)
cout << "YES\n";
else
cout << "NO\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin >> t;
while(t--)
solve();
return 0;
}
