#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
using LL = long long;
const int maxn = 5005;
vector<pair<int, int> > d[maxn];
int len1[maxn][maxn], len2[maxn][maxn];
int dp[maxn][maxn], 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(int 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(int 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;
        }
    }

    memset(dp, 0x3f, sizeof dp);
    dp[0][n + 1] = 0;
    d[0].push_back({0, n + 1});
    for(int i = 0; i < n; i++){
        for(auto [x, y] : d[i]){
            if (v[x][y]) continue;
            v[x][y] = true;
            int t1 = len1[x + 1][i + 1];
            int t2 = len2[y - 1][i + 1];
            if (x + t1 + 2 >= y || x + t2 + 2 >= y){
                cout << "Yes" << '\n';
                return 0;
            }
            if (i + 1 < dp[x + t1][y]){
                dp[x + t1][y] = i + 1;
                d[i + 1].push_back({x + t1, y});
            }
            if (i + 1 < dp[x][y - t2]){
                dp[x][y - t2] = i + 1;
                d[i + 1].push_back({x, y - t2});
            }
        }
    }
    cout << "No" << '\n';

}