#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn 5005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,k,w[maxn],s[maxn],d[maxn];
int f[maxn][maxn];
signed main(void){
	int i,j,r;
	read(n);read(k);
	for (i=1;i<=n;i++) read(w[i]);
	for (i=1;i<=k;i++) read(s[i]);
	int id=1;
	for (i=1;i<=n;i++) if (w[id]<w[i]) id=i;
	f[0][id]=id;
	for (i=1;i<=k;i++) {
		int l=id,res=w[id];
		for (j=id;j>=0;j--) {
			res-=w[j];
			while (l>1&&res+w[l-1]<=s[i]) l--,res+=w[l];
//			gdb(i,j,l,res);
			d[l]=max(d[l],f[i-1][j]);
		}
		res=0;l=f[i-1][id],r=f[i-1][id];
		while (r<n&&res+w[r+1]<=s[i]) r++,res+=w[r];
//		gdb(i,r,res);
		for (j=id;j>=1;j--) if (f[i-1][j]>0) {
			while (l>f[i-1][j]) res+=w[l],l--;
			while (res>s[i]) res-=w[r],r--;
			f[i][j]=max(f[i][j],r);
		}
		for (j=1;j<=id;j++) d[j]=max(d[j-1],d[j]);
		for (j=1;j<=id;j++) f[i][j]=max(f[i][j],d[j]),d[j]=0;
//		for (j=1;j<=id;j++) gdb(i,j,f[i][j]);
	}
	puts(f[k][1]>=n?"Yes":"No");
	return 0;
}