#include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
const int N = 5050;
int vis[N][N], nxt[N][N];
vector<ll> L[N], R[N];
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(n), b(k);
    for(auto &i : a) cin >> i;
    for(auto &i : b) cin >> i;

    memset(vis, -1, sizeof vis);
    queue<array<int, 2>> q[N];
    auto add = [&](int l, int r, int d) {
        if(vis[l][r] == -1) {
            vis[l][r] = d;
            q[d].push({l, r});
        } else {
            assert(vis[l][r] <= d);
        }
    };
    for(int i = 0; i < n; i++) {
        nxt[i][k] = k;
        for(int j = k;j--;) {
            nxt[i][j] = b[j] >= a[i] ? j : nxt[i][j + 1];
        }
    }
    for(int i = 0; i < n; i++) {
        add(i, i, 0);
        for(int j = i; j--;)
            L[i].push_back((L[i].empty() ? 0 : L[i].back()) + a[j]);
        for(int j = i + 1; j < n; j++)
            R[i].push_back((R[i].empty() ? 0 : R[i].back()) + a[j]);
    }
    for(int D = 0; D < k; D++)
    while(!q[D].empty()) {
        auto [x, y] = q[D].front();
        q[D].pop();
        int d = vis[x][y];
        if(d < k)
            d = min(x ? nxt[x - 1][d]  : k, y + 1 < n ? nxt[y + 1][d] : k);
        if(d < k) {
            int goL = upper_bound(all(L[x]), b[d]) - L[x].begin();
            int goR = upper_bound(all(R[y]), b[d]) - R[y].begin();
            // cout << x << " " << y << " " << goL << " " << goR << endl;
            add(x - goL, y, d + 1);
            add(x, y + goR, d + 1);
        }
    }
    cout << (vis[0][n - 1] == -1 ? "No" : "Yes") << '\n';
}