#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
bool f(vector<ll>nums1,vector<ll>nums2)
{
ll sum=0,idx1=0,idx2=0;
vector<ll>res;
while(idx1<nums2.size())
{
if(sum==nums1[idx2])
{
res.pb(sum),sum=0,idx2++;
if(res.size()==nums1.size())
{
break;
}
}
sum+=nums2[idx1],idx1++;
}
if(sum!=0)
{
res.pb(sum);
}
if(res==nums1)
{
return true;
}
else
{
return false;
}
}
void solve()
{
ll n,m,num1,num2;
bool flag=false;
cin>>n>>m;
vector<ll>nums1,nums2;
for(int i=0;i<n;i++)
{
cin>>num1;
nums1.pb(num1);
}
for(int i=0;i<m;i++)
{
cin>>num2;
nums2.pb(num2);
}
sort(all(nums2));
if(f(nums1,nums2))
{
flag=true;
}
else
{
while(next_permutation(all(nums2)))
{
if(f(nums1,nums2))
{
flag=true;
break;
}
}
}
if(flag)
{
cout<<"YES";
}
else
{
cout<<"NO";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
