#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tag_and_trait.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// namespace gt = __gnu_pbds;
#define IS_MULTITEST 0

using namespace std;

// #include "angel/math/modint.hpp"

#pragma region Macros
// clang-format off
using ll = long long; using uint = unsigned int; using ull = unsigned long long;
using i32 = int; using i64 = ll; using u32 = uint; using u64 = ull;
template <class T> using Vec = vector<T>;
template <class T> using RevPriq = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf32 = 1 << 30; constexpr ll inf64 = 1ll << 60;
constexpr char eoln = '\n';
#define L(i, l, r) for (int i = l; i < r; ++i)
#define R(i, l, r) for (int i = r - 1; i >= l; --i)
#define ALL(x) (x).begin(), (x).end()
#define mem(a, x) memset(a, x, sizeof(a))
#define sz(a) (int)((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
// clang-format on
#pragma endregion

// Coding Space

// vars
constexpr int MaxN = 5010, MaxK = 5010;
int N, K;
ll W[MaxN], S[MaxK];

// funcs

void main_() {
    cin >> N >> K;
    L(i, 0, N) cin >> W[i];
    L(i, 0, K) cin >> S[i];

    Vec<int> dp(N, 0);
    L(i, 0, N) dp[i] = i + 1;

    L(i, 0, K) {
        int p1 = 0, p2 = 0;
        ll sum1 = 0, sum2 = 0;
        auto ndp = dp;
        L(r, 0, N) {
            ndp[p1] = max(ndp[p1], dp[r]);
            sum1 += W[r];
            while (sum1 > S[i]) {
                sum1 -= W[p1++];
            }
        }
        L(r, 0, N) {
            L(j, (r == 0 ? 0 : dp[r - 1]), dp[r]) {
                sum2 -= W[j];
            }
            while (p2 != N and sum2 + W[p2] <= S[i]) {
                sum2 += W[p2++];
            }
            ndp[r] = max(ndp[r], p2);
        }
        dp = move(ndp);
    }

    const auto x = dp[0];
    cout << (x == N ? "Yes" : "No") << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    if constexpr (IS_MULTITEST == 0) {
        main_();
    } else {
        // multitest (cf-style)
        int T;
        cin >> T;
        while (T--) {
            main_();
            cout << flush;
        }
    }
}