#include <bits/stdc++.h>

const int N = 5005;

int n, k;
int w[N], s[N];

bool work(int l, int r, int t) {
    //printf("%d %d %d\n", l, r, t);
    if (l == r)
        return 1;
    if (t > k)
        return 0;
    int suml = 0, sumr = 0;
    int tl = l - 1, tr = r + 1;
    for (tl = l; tl <= r; ++tl) {
        if (suml + w[tl] > s[t])
            break;
        suml += w[tl];
    }
    if (tl > r)
        return 1;
    for (tr = r; tr >= l; --tr) {
        if (sumr + w[tr] > s[t])
            break;
        sumr += w[tr];
    }
    if (tr < l)
        return 1;
    if (suml <= sumr)
        return work(tl, r, t + 1);
    else
        return work(l, tr, t + 1);
}

int main() {
    std::cin >> n >> k;
    for (int i = 1; i <= n; ++i)
        std::cin >> w[i];
    for (int i = 1; i <= k; ++i)
        std::cin >> s[i];
    std::sort(s + 1, s + 1 + k);
    std::reverse(s + 1, s + 1 + k);
    int ans = work(1, n, 1);
    if (ans) {
        std::cout << "Yes\n";
    } else {
        std::cout << "No\n";
    }
    return 0;
}