#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;
	set<int> w;
	auto it = w.end();
	vector<int> x(n);
	for(auto &y : x) cin >> y;
	while(m--) cin >> _, w.insert(_);
	for(int i = 0; i < n - 1; ++i)
		for(int j = i + 1; j < n; ++j)
			if((it = w.lower_bound(x[j] - x[i])) != w.end())
				w.erase(it);
			else
				break;
	cout << (w.empty() ? "yes\n" : "no\n");
}