#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define int long long
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();
const int N = 25;
const int INF = 1e15;
const int MAXN = 4 * N;
const int MOD = 998244353;
int TN = 1;
int n, m, x;
int a[N], b[N], cnt[MAXN * 10];
void rec(int cur, int pos) {
if (cur == x) {
printf("YES\n"); exit(false);
}
if (cur > x) {
return;
}
if (pos > m) {
return;
}
rec(cur + b[pos], pos + 1);
rec(cur, pos + 1);
}
void subtask1() {
cin >> x;
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
rec(0, 1);
printf("NO\n");
exit(false);
}
void get() {
int sum = 0, j = 1;
for (int i = 1; i <= m; i++) {
sum += b[i];
if (sum == a[j]) {
j++; sum = 0;
if (j == n + 1) {
cout << "YES\n"; exit(false);
}
}
else if (sum > a[j]) {
return;
}
}
return;
}
void subtask2() {
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
sort(b + 1, b + 1 + m);
get();
while (next_permutation(b + 1, b + 1 + m)) {
get();
}
cout << "NO\n"; exit(false);
}
void tupoy_rakhshon(int pos) {
if (pos == n + 1) {
cout << "YES\n"; exit(false);
}
if (!a[pos]) {
tupoy_rakhshon(pos + 1);
}
for (int i = a[pos]; i > 0; i--) {
if (cnt[i] > 0) {
a[pos] -= i; cnt[i]--;
tupoy_rakhshon(pos);
a[pos] += i; cnt[i]++;
}
}
}
void subtask3() {
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
cin >> b[i]; cnt[b[i]]++;
}
tupoy_rakhshon(1);
cout << "NO\n"; exit(false);
}
signed main() {
// in; out; // cin >> TN;
cin >> n >> m;
if (n == 1) {
subtask1();
}
if (n <= 10 && m <= 10) {
subtask2();
}
subtask3();
return 0;
}
