#include <bits/stdc++.h>
#define int long long
#define moony long long
#define pii pair<int, int>
#define fi first
#define se second
#define ld long double
#define vi vector<int>
#define vii vector<vector<int>>
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define per(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
using namespace std;
const int MOD = 1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= MOD) a -= MOD;
return a;
}
int mul(int a, int b) {
(a *= b) %= MOD;
return a;
}
int ceil(int x, int y) {
return (x + y - 1) / y;
}
int bin_pow(int x, int y) {
int res = 1;
while (y) {
if (y & 1) res = res * x % MOD;
x = x * x % MOD;
y >>= 1;
}
return res;
}
template<class T> bool minimize(T& a, T b) {
if (a > b) return a = b, true;
return false;
}
template<class T> bool maximize(T& a, T b) {
if (a < b) return a = b, true;
return false;
}
const int INF = 1e17;
const int maxn = 2e6 + 5;
int n, m;
int a[maxn + 5], b[maxn + 5];
pair<int, int> f[maxn + 5];
void solve(int tc) {
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
f[0] = {0, 0};
for (int mask = 0; mask <= (1ll << m) - 1; ++mask) {
if (f[mask].first == n) {
cout << "YES";
return;
}
for (int i = 0; i < m; ++i) if (!(mask & (1ll << i))) {
int nmask = mask ^ (1ll << i);
if (f[mask].second + b[i] == a[f[mask].first]) {
maximize(f[nmask], make_pair(f[mask].first + 1, 0ll));
} else {
maximize(f[nmask], make_pair(f[mask].first, f[mask].second + b[i]));
}
}
}
cout << "NO";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) {
solve(i);
}
}
