#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
int N;
int M;
int Q;
int A[200000];
int B[200000];
int solve(int dep){
  int i;
  if(dep==Q){
    return 1;
  }
  i = B[dep];
  if((i==0 && A[i]-1 >= 0) || (i!=0 && A[i]-1 > A[i-1])){
    A[i]--;
    if(solve(dep+1)){
      return 1;
    }
    A[i]++;
  }
  if((i==M-1 && A[i]+1 < N) || (i!=M-1 && A[i]+1 < A[i+1])){
    A[i]++;
    if(solve(dep+1)){
      return 1;
    }
    A[i]--;
  }
  return 0;
}
int main(){
  rd(N);
  rd(M);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(M);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);
    }
  }
  rd(Q);
  {
    int e98WHCEY;
    for(e98WHCEY=(0);e98WHCEY<(Q);e98WHCEY++){
      rd(B[e98WHCEY]);B[e98WHCEY] += (-1);
    }
  }
  if(solve(0)){
    wt_L("YES");
    wt_L('\n');
  }
  else{
    wt_L("NO");
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int N, M, Q, A[2d5], B[2d5];
// 
// int solve(int dep){
//   int i;
//   if(dep==Q) return 1;
//   i = B[dep];
//   if((i==0 && A[i]-1 >= 0) || (i!=0 && A[i]-1 > A[i-1])){
//     A[i]--;
//     if(solve(dep+1)) return 1;
//     A[i]++;
//   }
//   if((i==M-1 && A[i]+1 < N) || (i!=M-1 && A[i]+1 < A[i+1])){
//     A[i]++;
//     if(solve(dep+1)) return 1;
//     A[i]--;
//   }
//   return 0;
// }
// 
// {
//   rd(N,M,(A--)(M),Q,(B--)(Q));
//   wt(if[solve(0), "YES", "NO"]);
// }