#include <bits/stdc++.h>
using namespace std;
int a[500];
int b[500];
int main() {
  int n, k;
  int flag = 0;
  scanf("%i %i", &n, &k);
  int temp = -1;
  for (int i = 0; i < n; i++) {
    scanf("%i", &a[i]);
  }
  int prev = -1;
  int res = 0;
  for (int i = 0; i < k; i++) {
    scanf("%i", &b[i]);
  }
  std::sort(b, b + k);
  int count = k - 1;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) a[i] = b[count--];
  }
  for (int i = 1; i < n; i++) {
    if (a[i] < a[i - 1]) {
      res = 1;
      break;
    }
  }
  if (res)
    printf("Yes");
  else
    printf("No");
  return 0;
}
