#include <bits/stdc++.h>
using namespace std;
#define accepted ios_base::sync_with_stdio(0);cin.tie(0);
#define Daulbekov signed
#define Makan main
#define int long long
#define double long double
#define pb push_back
#define F first
#define S second
const long long N=5e5+10;
const long long MOD=1e9+7;
const long long INF=2e18;
int binpow(int a,int b){
a%=MOD;
if(b==0)return 1;
if(b%2)return binpow(a,b-1)*a%MOD;
else {
int res=binpow(a,b/2);
return res*res%MOD;
}
}
bool cmp(pair<int,int>a,pair<int,int>b){
if(a.F/300!=b.F/300)return a.F/300<b.F/300;
return a.S<b.S;
}
Daulbekov Makan(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
accepted
int n,m;
cin>>n>>m;
int a[n],b[m];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
if(n>m){
cout<<"NO";
return 0;
}
if(n==1){
for(int j=0;j<(1<<20);j++){
int tot=0;
for(int i=0;i<m;i++){
if(j&(1<<i))tot+=b[i];
}
if(tot==a[0]){
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
}
sort(b,b+m);
do{
int sm=0,j=0,i=0;
for(;i<n;){
while(j<m&&sm<a[i]){
sm+=b[j];
j++;
}
if(sm==a[i])i++,sm=0;
else break;
if(j==m)break;
}
if(i==n){
cout<<"YES";
return 0;
}
}
while(next_permutation(b,b+m));
cout<<"NO";
}
