#include <bits/stdc++.h>
using namespace std;
int a[110], b[110];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= k; i++) scanf("%d", &b[i]);
  sort(b + 1, b + k + 1);
  for (int i = 1; i <= k / 2; i++) swap(b[i], b[k - i + 1]);
  int cnt = 0;
  for (int i = 1; i <= n; i++)
    if (!a[i]) a[i] = b[++cnt];
  for (int i = 1; i < n; i++)
    if (a[i] >= a[i + 1]) {
      printf("Yes\n");
      return 0;
    }
  printf("No\n");
  return 0;
}
