#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k; cin >> n >> k;
    vector<ll> w(n);
    for (int i = 0; i < n; ++i) {
        cin >> w[i];
    }
    vector<ll> s(k);
    vector<pair<ll,int>> v(k);
    for (int i = 0; i < k; ++i) {
        cin >> s[i];
        v[i] = {s[i], i};
    }
    sort(v.begin(), v.end());

    vector<vector<int>> L(k, vector<int>(n));
    vector<vector<int>> R(k, vector<int>(n));

    for (int i = 0; i < n; ++i) {
        int l = i;
        ll sum = 0;
        for (int j = 0; j < k; ++j) {
            while (l and sum+w[l-1] <= v[j].first) {
                l -= 1; sum += w[l];
            }
            L[v[j].second][i] = l;
        }
        int r = i;
        sum = 0;
        for (int j = 0; j < k; ++j) {
            while (r+1 < n and sum+w[r+1] <= v[j].first) {
                r += 1; sum += w[r];
            }
            R[v[j].second][i] = r;
        }
    }

    vector<pair<int,int>> q;
    for (int i = 0; i < n; ++i) {
        q.push_back({i, i});
    }

    for (int i = 0; i < k; ++i) {
        vector<pair<int,int>> nq;
        nq.reserve(q.size()*2);
        for (auto &p : q) {
            int nl = L[i][p.first];
            int nr = R[i][p.second];

            nq.push_back({nl, p.second});
            nq.push_back({p.first, nr});
        }

        sort(nq.begin(), nq.end());
        q.clear();
        for (int j = 0; j < nq.size(); ) {
            int l = nq[j].first;
            int r = nq[j].second;
            while (j < nq.size() and nq[j].first == l) {
                r = nq[j].second; j += 1;
            }
            q.push_back({l, r});
        }
    }
    if (q.size() and q[0].first == 0 and q[0].second == n-1) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}