#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500;
int a[MAXN], b[MAXN];
vector<int> z;
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  if (n == k) {
    cout << "Yes";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 0) z.push_back(i);
  }
  for (int i = 0; i < k; i++) {
    scanf("%d", &b[i]);
  }
  int last = -1;
  bool ok = true;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) continue;
    if (a[i] > last) {
      last = a[i];
    } else {
      ok = false;
      break;
    }
  }
  if (!ok) {
    cout << "Yes";
    return 0;
  }
  sort(b, b + k);
  reverse(b, b + k);
  int id = 0;
  for (auto i : z) {
    a[i] = b[id++];
  }
  bool oks = false;
  for (int i = 0; i < n - 1; i++) {
    if (a[i] > a[i + 1]) {
      oks = true;
      break;
    } else if (a[i] < a[i + 1])
      continue;
  }
  if (oks)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
