#include <bits/stdc++.h>

#define short int
#define ull unsigned long long
#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


using namespace std;

const ll inf = 1e18;
mt19937 rnd(234);


#ifdef LOCAL
bool local = true;
#else
bool local = false;
#endif




int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int n, k;
    cin >> n >> k;
    vector<ll> w(n);
    vector<ll> s(k);
    for (int i = 0; i < n; i += 1) {
        cin >> w[i];
    }
    for (int i = 0; i < k; i += 1) {
        cin >> s[i];
    }
    vector<vector<short>> go_left(k, vector<short>(n + 1)), go_right(k, vector<short>(n + 1));
    for (int i = 0; i < k; i += 1) {
        int t = 0;
        ll sm = 0;
        for (int j = 0; j < n; j += 1) {
            while (sm > s[i]) {
                sm -= w[t];
                t += 1;
            }
            go_left[i][j] = t;
            sm += w[j];
        }
        t = n - 1;
        sm = 0;
        for (int j = n - 1; j >= 0; j -= 1) {
            while (sm > s[i]) {
                sm -= w[t];
                t -= 1;
            }
            go_right[i][j] = t;
            sm += w[j];
        }
    }
    vector<vector<short>> dp(n + 1, vector<short>(n + 1, k + 1));
    for (int i = 0; i < n; i += 1) {
        dp[i][i] = 0;
    }
    for (int len = 1; len <= n; len += 1) {
        for (int l = 0; l + len - 1 < n; l += 1) {
            int r = l + len - 1;
            int x = dp[l][r];
            if (x < k) {
                dp[go_left[x][l]][r] = min<short>(dp[go_left[x][l]][r], x + 1);
                dp[l][go_right[x][r]] = min<short>(dp[l][go_right[x][r]], x + 1);
            }
        }
    }
    if (dp[0][n - 1] <= k) {
        cout << "Yes" << "\n";
    } else {
        cout << "No" << "\n";
    }
    return 0;
}


/*
6 7
3 2 1 1 2 3
2 2 2 2 2 2 2

7 4
1 2 3 4 3 2 1
3 3 3 3

*/