#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAX_N = 5000 + 5;

int N, M, w[MAX_N], s[MAX_N], f[MAX_N][MAX_N], maxv[MAX_N][MAX_N];
ll sum[MAX_N];

int bs1(int x, int r) {
    int l = 0;
    while (l < r) {
        int mid = l + r + 1 >> 1;
        if (maxv[mid][r] >= x) l = mid;
        else r = mid - 1;
    }
    return l;
}

int bs2(int x, int l, int r) {
    while (l < r) {
        int mid = l + r + 1 >> 1;
        if (sum[mid] - sum[l - 1] <= x) l = mid;
        else r = mid - 1;
    }
    return l;
}

int bs3(int x, int l, int r) {
    while (l < r) {
        int mid = l + r >> 1;
        if (sum[r] - sum[mid - 1] <= x) r = mid;
        else l = mid + 1;
    }
    return l;
}

int main() {
    scanf("%d%d", &N, &M);
    for (int i = 1; i <= N; i ++) {
        scanf("%d", w + i);
        sum[i] = sum[i - 1] + w[i];
    }
    for (int i = 1; i <= M; i ++) {
        scanf("%d", s + i);
        maxv[i][i] = s[i];
    }
    for (int i = 1; i < N; i ++)
        for (int j = i + 1; j <= N; j ++) maxv[i][j] = max(maxv[i][j - 1], s[i]);
    f[1][N] = N + 1;
    for (int i = N; i > 1; i --) {
        for (int l = 1, r = l + i - 1; r <= N; l ++, r ++) {
            if (f[l][r] < 1) continue;
            int t = bs1(w[l], f[l][r] - 1), p;
            if (t) {
                p = bs2(s[t], l, r);
                if (p >= r - 1) {
                    puts("Yes");
                    return 0;
                }
                f[p + 1][r] = max(f[p + 1][r], t);
            }
            t = bs1(w[r], f[l][r] - 1);
            if (t) {
                p = bs3(s[t], l, r);
                if (p <= l + 1) {
                    puts("Yes");
                    return 0;
                }
                f[l][p - 1] = max(f[l][p - 1], t);
            }
        }
    }
    puts("No");
    return 0;
}