/*
Author: baodat
※\(^o^)/※
Current goal: Training for VNOI shirt
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define FORD(i, l, r) for(int i = l; i >= r; i--)
#define db double
#define ldb long double
#define all_1(x) (x).begin() + 1, (x).end()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ins insert
#define pb push_back
template<typename T>void debug_var(const T& var, const string& name){
cerr << name << ": " << var << "\n";
}
template<typename T>void debug_1d(const T& vt, const string& name){
if(vt.empty()){
cerr << name << " is empty!\n";
return;
}
FOR(i, 0, (int)vt.size() - 1){
cerr << name << "[" << i << "]: " << vt[i] << "\n";
}
}
const ll oo = 2e18;
void solve(){
int n, m;
cin >> n >> m;
if(n > m) return void(cout << "NO\n");
vector<int>a(n + 1), b(m + 1);
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, m) cin >> b[i];
int MAX = (1 << m);
vector<int> dp(MAX + 1, -1), rem(MAX + 1, -1);
dp[0] = rem[0] = 0;
FOR(mask, 0, MAX - 1){
if(dp[mask] == -1) continue;
if(dp[mask] == n) return void(cout << "YES\n");
FOR(i, 1, m){
if(!(mask & (1 << (i - 1)))){
int nxt_mask = (mask | (1 << (i - 1)));
if(rem[mask] + b[i] < a[dp[mask] + 1]){
//sum is smaller
dp[nxt_mask] = dp[mask];
rem[nxt_mask] = rem[mask] + b[i];
}
else if(rem[mask] + b[i] == a[dp[mask] + 1]){
//okay append here
dp[nxt_mask] = dp[mask] + 1;
rem[nxt_mask] = 0; // use all already
}
}
}
}
cout << "NO\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
