#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int Maxn = 1e6;
int n, k;
int a[Maxn];
int b[Maxn];
int main() {
  int F = 0;
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 0 && F == 0) F = i;
  }
  for (int i = 1; i <= k; i++) scanf("%d", &b[i]);
  if (k >= 2)
    printf("Yes\n");
  else {
    a[F] = b[1];
    for (int i = 1; i < n; i++) {
      if (a[i] > a[i + 1]) {
        printf("Yes\n");
        return 0;
      }
    }
    printf("No\n");
  }
}
