#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

const int Maxn = 5050;

short f[Maxn][Maxn], maxr[Maxn][Maxn], minl[Maxn][Maxn];

LL sum[Maxn];
int a[Maxn], w[Maxn], mx[Maxn];
int n, m;

LL qsum(int l, int r){
    if (l > r) 
        return 0;
    return sum[r] - sum[l - 1];
}

short func(int l, int r);

bool checkleft(int l, int r, int i){
    if (mx[i] >= qsum(l, r))
        return true;
    short pos = maxr[i][l];
    if (pos < l)
        return false;
    if (func(pos + 1, r) <= i - 1)
        return true;
    if (func(pos + 2, r) <= i - 1 && mx[i - 1] >= qsum(pos + 2, r))
        return true;
    return false;
}

bool checkright(int l, int r, int i){
    if (mx[i] >= qsum(l, r))
        return true;
    short pos = minl[i][r];
    if (pos > r)
        return false;
    if (func(l, pos - 1) <= i - 1)
        return true;
    if (func(l, pos - 2) <= i - 1 && mx[i - 1] >= qsum(l, pos - 2))
        return true;
    return false;
}

short func(int l, int r){
    if (l >= r)
        return 0;
    if (f[l][r] >= 0)
        return f[l][r];
    short sk = max(func(l + 1, r), func(l, r - 1));
    for (int i = sk; i <= m; i++)
        if (checkleft(l, r, i) || checkright(l, r, i))
            return i;
    return f[l][r] = m + 1;
}

int main(){
    ios :: sync_with_stdio(false), cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i], sum[i] = sum[i - 1] + a[i];
    for (int i = 1; i <= m; i++)
        cin >> w[i], mx[i] = max(mx[i - 1], w[i]);
    w[++m] = sum[n], mx[m] = max(mx[m - 1], w[m]);
    for (int i = 1; i <= m; i++){
        for (int l = 1, r = 1; l <= n; l++){
            while (r <= n && qsum(l, r) <= w[i])
                r++;
            maxr[i][l] = r - 1;
        }
    }
    for (int i = 1; i <= m; i++){
        for (int r = n, l = n; r >= 1; r--){
            while (l >= 1 && qsum(l, r) <= w[i])
                l--;
            minl[i][r] = l + 1;
        }
    }
    memset(f, -1, sizeof f);
    cout << (func(1, n) <= m - 1 ? "Yes" : "No") << endl;
    return 0;
}