#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
void solve() {
  int n, m, b, c = 0, f = 0;
  cin >> n >> m;
  vector<int> v(n), v1(m);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    if (f == 0 && v[i] == 0) f = i;
  }
  for (long long i = 0; i < m; i++) cin >> v1[i];
  ;
  if (m == 1) {
    v[f] = v1[0];
    f = 0;
    for (int i = 0; i < n - 1; i++) {
      if (v[i] > v[i + 1]) f = 1;
    }
    if (f == 1)
      cout << "Yes";
    else
      cout << "No";
  } else
    cout << "Yes";
}
