#include <bits/stdc++.h>
using namespace std;
long long int ar[2005];
long long int br[2005];
long long int n, k;
void input() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> ar[i];
  for (int i = 1; i <= k; i++) cin >> br[i];
}
bool work() {
  int pos = 1;
  sort(br + 1, br + k + 1, greater<int>());
  for (int i = 1; i <= n; i++) {
    if (!ar[i]) {
      ar[i] = br[pos++];
    }
  }
  for (int i = 2; i <= n; i++) {
    if (ar[i] < ar[i - 1]) return true;
  }
  return false;
}
int main() {
  input();
  cout << (work() ? "Yes" : "No") << endl;
  return 0;
}
