#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

const int N = 5005;

int maxstart[N][N], maxend[N][N]; // [fan][index]
int dp[N][N]; // max last fan used

int w[N], s[N];

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> w[i];
  for (int i = 0; i < k; i++) cin >> s[i];
  for (int fan = 0; fan < k; fan++){
    int curs = s[fan];
    for (int l = 0, r = -1, sum = 0; l < n; sum = max(0, sum - w[l]), l++){
      r = max(r, l - 1);
      while (r + 1 < n && sum + w[r + 1] <= curs){
        sum += w[++r];
      }
      maxstart[fan][l] = r + 1;
    }
  }
  reverse(w, w + n);
  for (int fan = 0; fan < k; fan++){
    int curs = s[fan];
    for (int l = 0, r = -1, sum = 0; l < n; sum = max(0, sum - w[l]), l++){
      r = max(r, l - 1);
      while (r + 1 < n && sum + w[r + 1] <= curs){
        sum += w[++r];
      }
      maxend[fan][l] = r + 1;
    }
  }

  for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) dp[i][j] = -1;
  dp[0][0] = k;
  for (int l = 0; l <= n; l++){
    for (int r = 0; r <= n; r++){
      if (dp[l][r] == -1) continue;
      if (l + r >= n - 1){
        cout << "Yes" << endl;
        return 0;
      }
      if (dp[l][r] == 0) continue;
      int fan = dp[l][r] - 1;
      dp[maxstart[fan][l]][r] = max(dp[maxstart[fan][l]][r], fan);
      dp[l][maxend[fan][r]] = max(dp[l][maxend[fan][r]], fan);
    }
  }
  cout << "No" << endl;
}