#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 1e5 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
ll n, m;
multiset <ll> a, b;
const void solve(/*Armashka*/) {
cin >> n >> m;
for (int i = 1; i <= n; ++ i) {
ll x; cin >> x;
a.insert(x);
}
for (int i = 1; i <= m; ++ i) {
ll x; cin >> x;
b.insert(x);
}
while(b.sz) {
if (a.empty()) break;
auto cur = *b.rbegin();
b.erase(--b.end());
if (cur <= *a.rbegin()) {
if (*a.rbegin() - cur > 0) a.insert(*a.rbegin() - cur);
a.erase(--a.end());
}
}
if (a.sz) cout << "NO\n";
else cout << "YES\n";
}
signed main() {
fast;
//freopen("threesum.in", "r", stdin);
//freopen("threesum.out", "w", stdout);
int tt = 1;
//cin >> tt;
while (tt --) {
solve();
}
}
