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

#define int long long int
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repb(i, a, b) for(int i = (a); i >= (b); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back

#define ln '\n'
template<typename T1,typename T2>
ostream& operator <<(ostream& c,pair<T1,T2> &v){
	c<<"("<<v.ff<<","<<v.ss<<")"; return c;
}
template <template <class...> class TT, class ...T>
ostream& operator<<(ostream& out,TT<T...>& c){
    out<<"{ ";
    for(auto &x : c) out<<x<<" ";
    out<<"}"; return out;
}

const int MOD = 1e9+7, LIM = 3e5+5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int w[LIM], s[LIM];
int n, k;

struct interval{
	int l, r, pos;
};

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	int tests = 1;
	// cin >> tests;

	while(tests--){
		cin >> n >> k;
		rep(i, 0, n) cin >> w[i];
		rep(i, 0, k) cin >> s[k-1-i];

		queue<interval> q;
		q.push({0, n-1, 0});

		bool done[n][n];
		rep(i,0,n) rep(j,0,n) done[i][j] = 0;

		bool pos = 0;

		while(!q.empty()){

			auto t = q.front();
			q.pop();
			if(t.l>=t.r){
				pos = 1;
				break;
			}
			if(done[t.l][t.r]) continue;
			if(t.pos==k) continue;
			done[t.l][t.r] = 1;
			// try left
			int lpos = t.l, pref = 0;
			while((lpos<=t.r)&&(pref+w[lpos]<=s[t.pos])){				
				pref += w[lpos];
				lpos++;
			}
			// lpos, t.r will be left
			q.push({lpos, t.r, t.pos+1});
			int rpos = t.r; pref = 0;
			while((rpos>=t.l)&&(pref+w[rpos]<=s[t.pos])){
				pref += w[rpos];
				rpos--;
			}
			q.push({t.l, rpos, t.pos+1});
		}

		if(pos) cout << "Yes" << ln;
		else cout << "No" << ln;

	}

	return 0;
}