#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sz size
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fre(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define ss second
#define f first
#define ii pair<ll,ll>
#define pii pair<int,int>
const int N=3e6+7;
const ll inf=2e12+7;
const ll mod=1e9+7;
ll ans,f[N],un;
int n,q,a,m,b;
int main()
{
ios
cin>>n>>m;
vector<int> v(n),mn(m);
for(int i=0;i<n;++i)cin>>v[i];
for(int i=0;i<m;++i)cin>>mn[i];
sort(all(mn));
sort(all(v));
if(n==1)
{
for(int msk=0;msk<(1<<m);++msk)
{
ll x=0;
for(int i=0;i<m;++i)
{
if((msk>>i)&1)x+=mn[i];
}
if(x==v[0])
{
cout<<"YES";
return 0;
}
}
}
else
{
do
{
int in=0,ok=-1;
for(int i=0;i<n;++i)
{
ll x=0;
for(int j=in;j<m;++j)
{
x+=mn[j];
if(x==v[i])
{
ok=1;
in=j+1;
break;
}
if(x>v[i])
{
ok=-1;
in=-1;
break;
}
}
if(in==-1)break;
}
if(ok==1)
{
cout<<"YES";
return 0;
}
}
while(next_permutation(all(mn)));
}
cout<<"NO";
}
