#include <bits/stdc++.h>
using namespace std;
int cmp(int x, int y) { return x > y; }
int main() {
  int n, m;
  while (~scanf("%d %d", &n, &m)) {
    int a[200 + 10], b[200 + 10], c[100 + 2000];
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    memset(c, 0, sizeof(c));
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    for (int i = 0; i < m; i++) {
      scanf("%d", &b[i]);
    }
    sort(b, b + m, cmp);
    int k = 0;
    for (int i = 0; i < n; i++) {
      if (a[i] == 0) {
        a[i] = b[k++];
      }
      c[i] = a[i];
    }
    sort(a, a + n);
    int flag = 0;
    for (int i = 0; i < n; i++) {
      if (a[i] != c[i]) {
        flag = 1;
        break;
      }
    }
    if (flag) {
      printf("Yes\n");
    } else {
      printf("No\n");
    }
  }
}
