#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)
#define all(x) begin(x), end(x)
template <typename T>
bool chmax(T& a, const T& b) {
    return a < b ? (a = b, 1) : 0;
}
template <typename T>
bool chmin(T& a, const T& b) {
    return a > b ? (a = b, 1) : 0;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); ++i) {
        os << v[i];
        if (i < (int)v.size() - 1) os << " ";
    }
    return os;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int n, k;
    cin >> n >> k;
    vector<ll> w(n), s(k);
    for (auto& x : w) cin >> x;
    for (auto& x : s) cin >> x;

    vector<ll> cumsum(n + 1);
    rep(i, 0, n) cumsum[i + 1] = cumsum[i] + w[i];

    vector<int> min_right(n + 1, 1e9), max_left(n + 1, -1e9);
    min_right[0] = n;
    max_left[n] = 0;
    revrep(i, k, 0) {
        vector<int> new_min_right(n + 1, 1e9), new_max_left(n + 1, -1e9);
        rep(l, 0, n) {
            int r = min_right[l];
            if (r == 1e9) continue;
            int nl =
                upper_bound(all(cumsum), cumsum[l] + s[i]) - cumsum.begin();
            chmin(nl, r);
            chmin(new_min_right[nl], r);
            chmax(new_max_left[r], nl);
        }
        rep(r, 1, n + 1) {
            int l = max_left[r];
            if (l == -1e9) continue;
            int nr =
                lower_bound(all(cumsum), cumsum[r] - s[i]) - cumsum.begin();
            chmax(nr, l);
            chmax(new_max_left[nr], l);
            chmin(new_min_right[l], nr);
        }
        min_right.swap(new_min_right);
        max_left.swap(new_max_left);
    }
    rep(l, 0, n) {
        if (min_right[l] - l <= 1) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}