#include<bits/stdc++.h>
#define LL long long
#define mk make_pair
#define pii pair<int,int>
#define fi first
#define se second
using std::cin;
using std::cout;
using std::ios;
using std::max;
using std::min;
const int N = 5005;
const int INF = 2e4;
short f[N][N];
short pre[N][N];
short nxt[N][N];
int n,m;
int w[N],s[N];
int main(){
	
	scanf("%d%d",&n,&m);
	for(int i = 1;i <= n;++i) scanf("%d",&w[i]);
	for(int i = 1;i <= m;++i) scanf("%d",&s[i]);
	for(int i = 1;i <= n;++i)
		for(int j = 1;j <= n;++j) f[i][j] = INF;
	for(int i = 1;i <= m;++i){
		int r = 1;LL sum = 0;
		for(int j = 1;j <= n;++j){
			while(r <= n && sum + w[r] <= s[i]) sum += w[r++];
			nxt[j][i] = r;
			if(r != j) sum -= w[j];
			else ++r;
		}
		int l = n;sum = 0;
		for(int j = n;j >= 1;--j){
			while(l >= 1 && sum + w[l] <= s[i]) sum += w[l--];
			pre[j][i] = l;
			if(l != j) sum -= w[j];	
			else --l;
		}
	}
//	for(int i = 1;i <= n;++i){
//		printf("pos: %d\n",i);
//		for(int j = 1;j <= m;++j) printf("pre:%d nxt:%d\n",pre[i][j],nxt[i][j]);	
//	}
	for(int i = 1;i <= n;++i) f[i][i] = 0;
	for(int len = 1;len <= n;++len){
		for(int l = 1;l <= n;++l){
			int r = l + len - 1;
			if(f[l][r] >= m) continue;
			short v = f[l][r] + 1;
			if(r != n) f[l][nxt[r + 1][v] - 1] = min(f[l][nxt[r + 1][v] - 1],v);
			if(l != 1) f[pre[l - 1][v] + 1][r] = min(f[pre[l - 1][v] + 1][r],v);
		}
	}
	puts(f[1][n] <= m ? "Yes" : "No");
    return 0;
}