#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, _;
  cin >> n >> m;
  if (m > n * (n - 1) / 2) return cout << "no\n", 0;
  map<int, int> w;
  vector<int> x(n);
  for (auto &y : x) cin >> y;
  while (m--) cin >> _, ++w[_];
  for (int i = 0; i < n - 1; ++i)
    for (int j = i + 1; j < n; ++j){
		auto it = w.lower_bound(x[j] - x[i]);
      if ( it != w.end()) {
        --it->second;
        if (it->second == 0) w.erase(it);
      } else
        break;
	}
  cout << (w.empty() ? "yes\n" : "no\n");
}