#include <bits/stdc++.h>
using namespace std;
int n, m, w[5005], s[5005], dp[5005][5005], r[5005];
int main() {
	cin >> 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=0; i<=m; i++)
		for (int j=1; j<=n; j++)
			dp[i][j] = j;
	for (int i=1; i<=m; i++) {
		int p = r[n+1] = n, t = 0;
		for (int j=n; j; j--) {
			t += w[j];
			while (t > s[i]) t -= w[p--];
			r[j] = p;
		}
		p = 1, t = 0;
		for (int j=1; j<=n; j++) {
			dp[i][t] = max(dp[i][t], dp[i-1][j]);
			dp[i][j] = max(dp[i][j], r[dp[i-1][j]+1]);
			t += w[j];
			while (t > s[i]) t -= w[p++];
		}
	} puts (dp[m][1] == n ? "Yes" : "No");
}