#include<bits/stdc++.h>
using namespace std;

void solve(int t){
    int n,k;
    cin>>n>>k;
    
    vector<long long> pref(n);
    for(int i=0;i<n;i++){
        cin>>pref[i];
        if(i>0)pref[i]+=pref[i-1];
    }
    
    vector<long long> s(k);
    for(int i=0;i<k;i++){
        cin>>s[i];
    }
    
    vector dp(n,vector(k+1,-1));
    
    auto get = [&] (int l,int r) -> long long {
        if(l>r)return 0;
        return pref[r]-(l==0 ? 0 : pref[l-1]);
    };
    /*
      auto getsuccl = [&] (int pos,int bound,long long val) -> int {
      int low = pos-1, up = bound, mid;
      while(up-low>1){
      mid = (up+low)/2;
      if(get(pos,mid)<=val)low=mid;
      else up=mid;
      }
      return up;
      };
     */
    auto getsucc = [&] (int pos,int bound,long long val) -> int {
        int up = pos+1, low = bound, mid;
        while(up-low>1){
            mid = (up+low)/2;
            if(get(mid,pos)<=val)up=mid;
            else low=mid;
        }
        return low;
    };
    
    auto f = [&] (int sx,int ind) -> int {
        if(ind==0){
            if(sx==0)return n-1;
            return -1;
        }
        
        int ans = INT_MAX;
        
        int tmp = getsucc(sx-1,-1,s[ind-1]);
        if(dp[tmp+1][ind-1]!=-1){
            ans=min(ans,dp[tmp+1][ind-1]);
        }
        
        if(dp[sx][ind-1]!=-1){
            ans=min(ans,getsucc(dp[sx][ind-1],sx,s[ind-1]));
        }
        
        if(ans<sx)ans=sx;
        if(ans==INT_MAX)ans=-1;
        
        
        return ans;
    };
    
    for(int i=0;i<=k;i++){
        for(int j=0;j<n;j++){
            dp[j][i] = f(j,i);
            //cout<<j<<" "<<i<<" "<<dp[j][i]<<"\n";
        }
    }
    
    
    for(int i=0;i<n;i++){
        if(dp[i][k]!=-1 && dp[i][k]<=i){
            cout<<"Yes\n";
            return;
        }
    }
    cout<<"No\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}