#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int, k>
template<class A, class B> void cmx(A &x, B y) { x = max<A>(x, y);}
template<class A, class B> void cmn(A &x, B y) { x = min<A>(x, y);}
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N=5005;
short r[N][N],l[N][N];
int n,m,a[N],b[N],f[N][N];
ll s[N];
ll S(int l,int r){
    return s[r]-s[l-1];
}
signed main() {
    //cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i],s[i]=s[i-1]+a[i];
    for(int i=1;i<=m;i++)
        cin>>b[i];
    reverse(b+1,b+m+1);
    for(int i=1;i<=m;i++){
        r[i][n+1]=n+1;
        for(int j=1,k=0;j<=n;j++){
            while(k<n&&S(j,k+1)<=b[i])
                k++;
            r[i][j]=k;
        }
        l[i][0]=0;
        for(int j=n,k=n+1;j;j--){
            while(k>1&&S(k-1,j)<=b[i])
                k--;
            l[i][j]=k;
        }
    }
    memset(f,-1,sizeof f);
    f[0][0]=0;
    for(int i=1;i<=m;i++){
        for(int j=0;j<=n;j++)
            if(f[i-1][j]!=-1){
                f[i][r[i][j+1]]=max(f[i][r[i][j+1]],f[i-1][j]);
                f[i][j]=max(f[i][j],f[i-1][j]+n-l[i][n-f[i-1][j]]+1);
            }
        for(int j=0;j<=n;j++)
            if(f[i][j]!=-1&&f[i][j]+j>=n-1)
                cout<<"Yes\n",exit(0);
    }
    cout<<"No\n";
}