#include <bits/stdc++.h>
using namespace std;
int n, k, q;
vector<int> a, b;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> q;
    a.push_back(q);
  }
  for (int i = 0; i < k; i++) {
    cin >> q;
    b.push_back(q);
  }
  sort(b.begin(), b.end());
  for (int i = 0; i < n; i++) {
    if (a[i] == 0 && i != 0 && b[0] <= a[i - 1] ||
        a[i] == 0 && i <= k - 2 && b[0] >= a[i + 1]) {
      cout << "Yes";
      return 0;
    } else if (a[i] != 0 && i != 0 && a[i - 1] >= a[i] && a[i - 1] != 0) {
      cout << "Yes";
      return 0;
    } else if (a[i] == 0) {
      a[i] = b[b.size() - 1];
      b.erase(b.begin() + b.size() - 1);
    }
  }
  cout << "No";
  return 0;
}
