#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(s) (int)s.size()
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define REP(i,a,b) for(int i=a;i>=b;--i)
#define ALL(v) v.begin(),v.end()
#define BIT(x,i) (((x) >> (i)) & 1)
#define MASK(i) (1 << (i))
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int base = 311;
const ll INF = 1e18;
/// REXDINO FROM LTV HSGS ///
int n, m, a[N], b[N];
int dp[MASK(20) + 5];
int sum[MASK(20) + 5];
int pre[N];
void solve(){
cin >> n >> m;
FOR(i, 1, n) cin >> a[i], pre[i] = pre[i-1] + a[i];
FOR(i, 1, m) cin >> b[i];
FOR(i, 0, m - 1) sum[MASK(i)] = b[i + 1];
FOR(mask, 0, MASK(m) - 1){
if (__builtin_popcount(mask) > 1){
int tmp = mask & -mask;
sum[mask] = sum[mask ^ tmp] + sum[tmp];
}
}
int ans = 0;
FOR(mask, 0, MASK(m) - 1){
FOR(i, 0, m - 1) if (BIT(mask, i)){
int iMask = mask ^ MASK(i);
dp[mask] = max(dp[mask], dp[iMask]);
int x = dp[iMask];
int cur = sum[mask] - pre[x];
if (cur == a[x + 1]) dp[mask] = max(dp[mask], x + 1);
}
ans = max(ans, dp[mask]);
}
if (ans >= n) cout << "YES";
else cout << "NO";
}
signed main(){
#define NAME "bank"
if (fopen(NAME".in", "r")){
freopen(NAME".in", "r", stdin);
freopen(NAME".out", "w", stdout);
}
ios_base::sync_with_stdio(false); cin.tie(nullptr);
solve();
return 0;
}
