#include <bits/stdc++.h>
#define file_in(x) (freopen(#x".in", "r", stdin))
#define file_out(x) (freopen(#x".out", "w", stdout))
#define file_ans(x) (freopen(#x".ans", "w", stdout))
#define int long long
#define vi vector
#define pr pair <int, int>
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define db double

using namespace std;

char _c; bool _f; template <class T> void IN(T &x) {
  _f = x = 0; while (_c = getchar(), !isdigit(_c)) {if (_c == '-') _f = 1;}
  while (isdigit(_c)) {x = x * 10 + _c - '0', _c = getchar();} if (_f) x = -x;
}

template <class T> void _write(T x) {
  if (x < 0) return putchar('-'), _write(-x);
  if (x > 9) _write(x / 10);
  putchar('0' + x % 10);
}
template <class T> void write(T x) {_write(x), putchar('\n');}
template <class T> void write_s(T x) {_write(x), putchar(' ');}
template <class first, class... rest> void write(first fir, rest... res) {
  write_s(fir), write(res...);
}
#define debug(...) (_debug(#__VA_ARGS__, __VA_ARGS__))
template <class T> void _debug(const char *format, T x) {
  cerr << format << " = " << x << endl;
}
template <class first, class... rest>
void _debug(const char *format, first fir, rest... res) {
  while (*format != ',') cerr << *format++;
  cerr << " = " << fir << ",", _debug(format + 1, res...);
}

bool START;

const int N = 2e3 + 5, mod = 998244353;

int n, m, w[N], s[N], f[N][N], g[N][N], df[N][N], dg[N][N], pre[N];
pr e[N];

bool END;

signed main() {
  IN(n), IN(m);
  for (int i = 1; i <= n; ++i) IN(w[i]), pre[i] = pre[i - 1] + w[i];
  for (int i = 1; i <= m; ++i) IN(s[i]), e[i] = mk(s[i], i);
  sort(e + 1, e + 1 + m);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1, k = i; j <= m; ++j) {
      while (k < n && pre[k] - pre[i - 1] <= e[j].fi) k++;
      df[i][e[j].se] = k;
    }
  }
  for (int i = n; i; --i) {
    for (int j = 1, k = i; j <= m; ++j) {
      while (k > 1 && pre[i] - pre[k - 1] <= e[j].fi) k--;
      dg[i][e[j].se] = k;
    }
  }
  for (int i = 1; i <= n; ++i) f[i][1] = df[i][1], g[i][1] = dg[i][1];
  for (int j = 2; j <= m; ++j) {
    for (int i = 1, k = 1; i <= n; ++i) {
      while (k < n && g[k + 1][j - 1] <= df[i][j]) k++;
      f[i][j] = max(f[i][j - 1], max(k, f[df[i][j]][j - 1]));
    }
    for (int i = n, k = n; i; --i) {
      while (k > 1 && f[k - 1][j - 1] >= dg[i][j]) k--;
      g[i][j] = min(g[i][j - 1], min(k, g[dg[i][j]][j - 1]));
    }
  }
  if (f[1][m] == n || g[n][m] == 1) puts("Yes");
  else puts("No");
  return 0;
}