// #pragma GCC optimize("Ofast") // #pragma GCC target("avx,avx2,fma") // #pragma GCC optimization("unroll-loops") // #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt") #include <bits/stdc++.h> #define ll long long #define ld long double //#define int long long #define pb push_back #define ff first #define ss second #define vll vector<ll> #define pll pair<ll,ll> #define all(v) v.begin(),v.end() #define allr(v) v.rbegin(),v.rend() #define str string #define vec vector #define aura #define rep(i,st,fn) for(ll i=(st);i<=(fn);i++) #define per(i,st,fn) for(ll i=(st);i>=(fn);i--) #define gcd __gcd using namespace std; const int mod=1e9+7; ll binpow (ll a, ll n) { if(n==0)return 1; if(n==1)return a%mod; if(n%2==1)return binpow(a,n-1)*a%mod; ll x=binpow(a,n/2); return x*x%mod; } ll lcm (ll a, ll b) { return a / gcd (a, b) * b; } const ll maxn=2e5+123; const ll inf=1e18; double pi=acos(-1.0); void koena(){ ll n,m; cin>>n>>m; vll a(n+1),b(m+1); for(ll i=1;i<=n;i++){ cin>>a[i]; a[i]+=a[i-1]; } for(ll i=1;i<=m;i++){ cin>>b[i]; //b[i]+=b[i-1]; } for(ll i=0;i<n;i++){ a[i]=a[i+1]; } for(ll i=0;i<m;i++){ b[i]=b[i+1]; } vll dp(1ll<<(m+1)); bool h=0; for(ll mask=0;mask<(1ll<<m);mask++){ if(dp[mask]==n){ h=1; break; } ll x=a[dp[mask]]; for(ll i=0;i<m;i++){ if(mask & (1ll<<i)) x-=b[i]; } for(ll i=0;i<m;i++){ if(!(mask & (1ll<<i))){ if(b[i]<=x){ dp[mask | (1ll<<i)]=max(dp[mask | (1ll<<i)],dp[mask]+(b[i]==x)); } } } } cout<<(h ? "YES" : "NO"); } signed main(){ //freopen("std.in","r",stdin); //freopen("std.out","w",stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll timur=1; //cin>>timur; ll laksj=0; while(timur--){ laksj++; //cout<<"Case "<<laksj<<": "<<"\n"; koena(); cout<<"\n"; } }