#include <bits/stdc++.h>
using namespace std;
int a[205], b[205], c[205];
int main() {
  int n, k;
  while (~scanf("%d%d", &n, &k)) {
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    for (int i = 0; i < k; i++) scanf("%d", &b[i]);
    sort(b, b + k);
    int len = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (a[i] == 0) {
        a[i] = b[len++];
      }
      c[i] = a[i];
    }
    int flag = 0;
    sort(c, c + n);
    for (int i = 0; i < n; i++) {
      if (a[i] == c[i]) flag++;
    }
    if (flag == n) {
      printf("No\n");
    } else {
      printf("Yes\n");
    }
  }
  return 0;
}
