#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
using LL = long long;
const int maxn = 5005;
vector<pair<short, short> > d[maxn];
short len1[maxn][maxn], len2[maxn][maxn], dp[maxn][maxn];
int w[maxn], s[maxn], id[maxn];
bool v[maxn][maxn];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> w[i];
    for(int i = 1; i <= k; i++) 
        cin >> s[i], id[i] = i;
    sort(id + 1, id + k + 1, [&](int a, int b){
        return s[a] < s[b];
    });

    for(int i = 1; i <= n; i++){
        LL sum = 0;
        for(short j = 1, pos = i - 1; j <= k; j++){
            while(pos + 1 <= n && sum + w[pos + 1] <= s[id[j]]){
                sum += w[++pos];
            }
            len1[i][id[j]] = pos - i + 1;
        }
    }
    for(int i = 1; i <= n; i++){
        LL sum = 0;
        for(short j = 1, pos = i + 1; j <= k; j++){
            while(pos - 1 >= 1 && sum + w[pos - 1] <= s[id[j]]){
                sum += w[--pos];
            }
            len2[i][id[j]] = i - pos + 1;
        }
    }

    for(int i = 0; i <= n + 1; i++){
        for(int j = 0; j <= n + 1; j++){
            dp[i][j] = n + 5000;
        }
    }
    dp[0][0] = n + 1;
    // 用了后k个魔法,左端点在j时最小的右端点.
    for(int i = 1; i <= k; i++){
        for(int j = n + 1; j >= 0; j--){
            if (j + 1 <= n + 1){
                dp[i][j] = min(dp[i][j], dp[i][j + 1]);
            }
            int t = len2[j][k - i + 1];
            dp[i][j] = min(dp[i][j], dp[i - 1][j - t]);
            if (dp[i - 1][j] <= n + 1){
                short t1 = len2[dp[i - 1][j] - 1][k - i + 1];
                short tmp = dp[i - 1][j] - t1;
                dp[i][j] = min(dp[i][j], tmp);
            }
            if (j + 2 >= dp[i][j]){
                cout << "Yes" << '\n';
                return 0;
            }
        }
    }
    cout << "No" << '\n';

}