#include <bits/stdc++.h>

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n, k;
    std::cin >> n >> k;
    std::vector<int> w(n), s(k);
    for (auto &x : w) std::cin >> x;
    for (auto &x : s) std::cin >> x;
    std::vector gol(k, std::vector<short>(n));
    std::vector gor(k, std::vector<short>(n));
    std::vector pos(n, std::vector<short>(k));
    for (int i = 0; i < n; i += 1) {
        int last = -1;
        for (int j = 0; j < k; j += 1) {
            if (s[j] >= w[i]) {
                last = j;
            }
            pos[i][j] = last;
        }
    }
    for (int i = 0; i < k; i += 1) {
        short nxt = 0;
        long long sum = 0;
        for (int j = 0; j < n; j += 1) {
            if (nxt < j) {
                nxt = j;
                sum = 0;
            }
            while(nxt < n && sum + w[nxt] <= s[i]) {
                sum += w[nxt];
                nxt += 1;
            }
            gol[i][j] = std::min(nxt, (short)(n - 1));
            sum -= w[j];
        }
        sum = 0;
        nxt = n - 1;
        for (int j = n - 1; j >= 0; j -= 1) {
            if (nxt > j) {
                nxt = j;
                sum = 0;
            }
            while(nxt >= 0 && sum + w[nxt] <= s[i]) {
                sum += w[nxt];
                nxt -= 1;
            }
            gor[i][j] = std::max(nxt, (short)0);
            sum -= w[j];
        }
    }

    std::vector dp(n, std::vector<short>(n, -2));
    dp[0][n - 1] = k - 1;
    for (int len = n; len >= 2; len -= 1) {
        for (int l = 0; l + len - 1 < n; l += 1) {
            int r = l + len - 1;
            if (dp[l][r] <= -1) continue;
            short cur = dp[l][r];
            int p = pos[l][cur];
            // std::cerr << l << " " << r << " " << dp[l][r] << "\n";
            if (p != -1) dp[std::min(short(r), gol[p][l])][r] = std::max(dp[std::min(short(r), gol[p][l])][r], short(cur - 1));
            p = pos[r][cur];
            if (p != -1) dp[l][std::max(short(l), gor[p][r])] = std::max(dp[l][std::max(short(l), gor[p][r])], short(cur - 1));
        }
    }  
    for (int i = 0; i < n; i += 1) {
        if (dp[i][i] >= -1) {
            std::cout << "Yes\n";
            return 0;
        }
    }
    std::cout << "No\n";
    return 0;
}