#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, 0, 0, -1};
int dy[] = {0, 0, 1, -1, 0};
const long long mod = 1000000000 + 7;
map<int, bool> m;
int main() {
  int n, k;
  scanf("%d", &n);
  scanf("%d", &k);
  int a[n];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  vector<int> b(k);
  for (int i = 0; i < k; i++) scanf("%d", &b[i]);
  sort(b.rbegin(), b.rend());
  int j = 0;
  for (int i = 0; i < n; i++) {
    if (!a[i]) {
      a[i] = b[j++];
    }
  }
  for (int i = 1; i < n; i++) {
    if (a[i] <= a[i - 1]) {
      puts("Yes");
      return 0;
    }
  }
  puts("No");
}
