/// In the name of GOD
/// I love my MOTHER
/// Only GOLD
#include <bits/stdc++.h>
#define sz(s) (ll)(s.size())
#define all(x) (x.begin(), x.end())
#define pb push_back
#define pf push_front
#define F first
#define S second
#define mp make_pair
#define ort1 exit(0);
#define nl endl
#define rep(i, l, r) for(int i = (l); i <= (r); ++i)
#define per(i, l, r) for(int i = (l); i >= (r); --i)
#define TL clock() / (double)CLOCKS_PER_SEC
#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
const double pi = acos(-1.0);
const double eps = 1e-9;
const long long inf = 1e12 + 1;
const long long INF = 1e18 + 1;
const int mod = 1e9 + 7;
const int N = 5e5 + 7;
int n, m;
int a[N];
int b[N];
bool bl[N];
int main(){
NFS
#ifdef ioi
freopen("in.txt", "r", stdin);
#else
//freopen("bank.in", "r", stdin);
//freopen("bank.out", "w", stdout);
#endif
cin >> n >> m;
rep(i, 1, n){
cin >> a[i];
}
rep(i, 1, m){
cin >> b[i];
}
rep(q, 1, n){
int cost = 0;
rep(i, 1, m - 1){
if(bl[i]) continue;
bl[i] = 1;
cost = b[i];
rep(j, i + 1, m){
if(bl[j]) continue;
if(cost + b[j] <= a[q]) cost += b[j], bl[j] = 1;
if(cost == a[q]){
break;
}
}
if(cost == a[q]) break;
}
if(cost != a[q]){
cout << "NO";
ort1
}
}
cout << "YES";
ort1
}
