#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define S second
#define pb push_back
#define F first
#define int long long
const long long inf = 2e9 + 7;
const int N = 4e5 + 101;
pair<int, int>dp[(1<<20)];
int a[N], b[N];
void solve(){
int n, m;
cin>>n>>m;
for(int i = 1; i <= n; i++) cin>>a[i];
for(int i = 1; i <= m; i++) cin>>b[i];
for(int msk = 0; msk < (1<<m); msk++){
int sum = dp[msk].S;
int j = dp[msk].F;
if(j == n){
cout<<"YES\n";
return;
}
for(int i = 0; i < m; i++){
if((msk>>i) & 1) continue;
if(sum + b[i + 1] == a[j + 1]){
if(dp[msk | (1<<i)].F > j + 1) continue;
dp[msk | (1<<i)].F = j + 1;
dp[msk | (1<<i)].S = 0;
}
else if(sum + b[i + 1] < a[j + 1]){
if(dp[msk | (1<<i)].F > j) continue;
if(dp[msk | (1<<i)].F == j) dp[msk | (1<<i)].S = max(dp[msk | (1<<i)].S, sum + b[i + 1]);
else dp[msk | (1<<i)].S = sum + b[i + 1];
dp[msk | (1<<i)].F = j;
}
}
}
cout<<"NO";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
//freopen("promote.in", "r", stdin);
//freopen("promote.out", "w", stdout);
int t = 1;
while(t--){
solve();
}
}
