#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 600005
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
ll T, n, a[N], t, m, b[N], vis[N];
void solve(int x) {
if(!a[x]) x++;
if(x == n + 1) {
cout << "YES\n";
exit(0);
}
for(int i=1;i<=m;i++) {
if(a[x] >= b[i] && vis[i] == 0) {
vis[i] = 1;
a[x] -= b[i];
solve(x);
a[x] += b[i];
vis[i] = 0;
}
}
}
int main () {
ios::sync_with_stdio(0);cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= m; i++) {
cin >> b[i];
}
solve(1);
cout << "NO\n";
}
