#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
//-----------------------
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define mem(f,x) memset(f, x, sizeof(f))
#define __lcm(a, b) (1ll * a * b) / __gcd(a, b)
#define bit(mask, i) ((mask >> i) & 1)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define el '\n'
#define F first
#define S second
#define io(x) freopen(x".inp","r",stdin),freopen(x".out","w",stdout)
template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }
//-----------------------
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4]{0, 1, 0, -1}, dy[4]{1, 0, -1, 0}; // R D L U
const int ddx[4]{-1, 1, 1, -1}, ddy[4]{1, 1, -1, -1}; // UR DR DL UL
const char cx[4]{'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};
const int maxn = 25;
int n, m, a[maxn], b[maxn], C[1 << 20], L[1 << 20];
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];
mem(C, -1); mem(L, -1); C[0] = L[0] = 0;
for (int mask = 0; mask < (1 << m); ++mask) {
for (int lst = 0; lst < m; ++lst) {
if (!bit(mask, lst)) continue;
int prev = mask ^ (1 << lst);
if (C[prev] == -1) continue;
int nxt = L[prev] + b[lst];
int nxtP = a[C[prev]];
if (nxt < nxtP) {
C[mask] = C[prev];
L[mask] = nxt;
} else if (nxt == nxtP) {
C[mask] = C[prev] + 1;
L[mask] = 0;
}
}
if (C[mask] == n) return cout << "YES", void();
}
cout << "NO";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.inp", "r", stdin);
freopen("output.out", "w", stdout);
#endif
if (!MULTI) solve();
else {
int test; cin >> test;
while (test--) solve();
}
return 0;
}
