#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int n, k, a[maxn], ans;
bool cmpb(int x, int y) { return x < y; }
int main() {
  while (~scanf("%d %d", &n, &k)) {
    ans = 1;
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    for (int i = 0; i < n; i++) {
      if (!a[i]) {
        scanf("%d", &a[i]);
      }
    }
    if (1 >= k) {
      ans = 0;
      for (int i = 0; i < (n - 1); i++) {
        if (a[i] >= a[i + 1]) {
          ans = 1;
          break;
        }
      }
    }
    printf("%s\n", (ans ? "Yes" : "No"));
  }
  return 0;
}
