#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5005;
int n,k,l[N],r[N],w[N];
ll sum[N],s[N];
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
int main(){
    cin>>n>>k;
    For(i,1,n)cin>>w[i];//读取
    For(i,1,n)sum[i]=sum[i-1]+w[i];//前缀和
    For(i,1,k)cin>>s[i];//风
    For(i,1,n)r[i]=l[i]=i;//从i向右合并，从i向左合并
    For(o,1,k){
        For(i,1,n){
            int tmp=r[i];
            while(r[i] < n && sum[r[i]+1] - sum[tmp] <= s[o])r[i]++;
            tmp=l[i];
            while(l[i] > 1 && sum[tmp-1] - sum[l[i]-2] <= s[o])l[i]--;
        }
   //     For(i,1,n){l[r[i]]=min(l[r[i]],i); r[l[i]]=max(r[l[i]],i);}
        //For(i,1,n)cout<<l[i]<<" "<<i<<endl;
    }  
    if(r[1]==n)puts("Yes"); else puts("No");

}