#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
const int maxn = 200;
int n, k;
int a[maxn], b[maxn];
vector<int> v;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    if (a[i] == 0) {
      v.push_back(i);
    }
  }
  for (int i = 0; i < k; ++i) {
    scanf("%d", &b[i]);
  }
  sort(b, b + k);
  for (int i = 0; i < k; ++i) {
    a[v[i]] = b[k - i - 1];
  }
  bool flag = true;
  for (int i = 1; i < n; ++i) {
    if (a[i] < a[i - 1]) {
      flag = false;
      break;
    }
  }
  if (!flag) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}
