#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, K;
vector<Int> W;
vector<Int> S;

int main() {
  for (; ~scanf("%d%d", &N, &K); ) {
    W.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &W[i]);
    }
    S.resize(K);
    for (int k = 0; k < K; ++k) {
      scanf("%lld", &S[k]);
    }
    
    vector<Int> WSum(N + 1, 0);
    for (int i = 0; i < N; ++i) {
      WSum[i + 1] = WSum[i] + W[i];
    }
    
    // l -> min r
    vector<int> crt(N + 1, N + 1);
    crt[0] = N;
    for (int k = K; --k >= 0; ) {
      vector<int> lr(N + 1), rl(N + 1);
      for (int l = 0, r = 0; l <= N; ++l) {
        for (; r + 1 <= N && WSum[r + 1] - WSum[l] <= S[k]; ++r) {}
        lr[l] = r;
      }
      for (int r = N, l = N; r >= N; --r) {
        for (; l - 1 >= 0 && WSum[r] - WSum[l - 1] <= S[k]; --l) {}
        rl[r] = l;
      }
      auto nxt = crt;
      for (int l = 0; l <= N; ++l) {
        const int r = crt[l];
        if (r <= N) {
          {
            int ll = lr[l];
            chmin(ll, r - 1);
            chmin(nxt[ll], r);
          }
          {
            int rr = rl[r];
            chmax(rr, l + 1);
            chmin(nxt[l], rr);
          }
        }
      }
      crt = nxt;
// cerr<<"nxt = "<<nxt<<endl;
    }
    
    bool ans = false;
    for (int l = 0; l < N; ++l) {
      ans = ans || (crt[l] <= l + 1);
    }
    puts(ans ? "Yes" : "No");
  }
  return 0;
}