// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 5005;

int n, k;
int w[MAXN], s[MAXN];
ll psm[MAXN];
vii dp, pdp;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> k;
    REP (i, 1, n + 1) {
        cin >> w[i];
        psm[i] = psm[i - 1] + w[i];
    }
    REP (i, 1, k + 1) {
        cin >> s[i];
    }
    pdp.pb({1, n});
    RREP (i, k, 1) {
        int nxt = 1;
        for (auto [l, r] : pdp) {
            while (nxt <= n && psm[nxt] - psm[l - 1] <= s[i]) {
                nxt++;
            }
            if (nxt >= r) {
                cout << "Yes\n";
                return 0;
            }
            dp.pb({nxt, r});
        }
        reverse(ALL(pdp));
        int prv = n;
        for (auto [l, r] : pdp) {
            while (prv >= 1 && psm[r] - psm[prv - 1] <= s[i]) {
                prv--;
            }
            if (l >= prv) {
                cout << "Yes\n";
                return 0;
            }
            dp.pb({l, prv});
        }
        sort(ALL(dp), [&] (ii a, ii b) {
                if (a.FI == b.FI) return a.SE > b.SE;
                return a.FI < b.FI;
                });
        pdp.clear();
        for (auto [l, r] : dp) {
            while (!pdp.empty() && pdp.back().SE >= r) {
                pdp.pop_back();
            }
            pdp.pb({l, r});
        }
    }
    cout << "No\n";
    return 0;
}