#include<algorithm>
#include<iostream>
#include<vector>
#include<cassert>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

#define DEBUG 0

#define M 214514
int n,m,q;
int a[M],b[M];
vi tu[M];
vi mv[M];
vi lo[M];

void stop(void){
  cout<<"NO"<<endl;
  exit(0);
}

void solve(vi &a,const vi&con){
  int fst=a[0];
  int len=con.size();
  vi uu=con;
  rep(i,len-1)uu[i+1]=max(uu[i+1],uu[i]-1);
  for(int i=len-2;i>=0;i--)uu[i]=max(uu[i],uu[i+1]-1);
  if(fst<con[0])stop();
  int c=fst;
  for(int i=1;i<len;i++){
    a.push_back(uu[i]<=c-1?--c:++c);
  }
  assert(a.size()==len);
  rep(i,len)if(a[i]<uu[i]||a[i]>n)stop();
}

int main(){
  cin>>n>>m;
  rep(i,m)cin>>a[i];
  cin>>q;
  rep(i,q)cin>>b[i];
  //assert
  assert(1<=n&&n<=1000000);
  assert(1<=m&&m<=n&&n<=200000);
  rep(i,m-1)assert(a[i]<a[i+1]);
  rep(i,m)assert(1<=a[i]&&a[i]<=n);
  rep(i,q)assert(1<=b[i]&&b[i]<=m);
  //解
  rep(i,q)tu[b[i]-1].push_back(i);
  rep(i,m){
    rep(j,tu[i].size()+1){
      int now=j==(int)0?-1:tu[i][j-1];
      int nxt=j>=(int)tu[i].size()?q:tu[i][j];
      if(i>0){
        now=lower_bound(tu[i-1].begin(),tu[i-1].end(),now)-tu[i-1].begin();
        nxt=lower_bound(tu[i-1].begin(),tu[i-1].end(),nxt)-tu[i-1].begin();
        int ma=0;
        for(int k=now;k<=nxt;k++)ma=max(ma,mv[i-1][k]);
        lo[i].push_back(ma+1);
      }else{
        lo[i].push_back(1);
      }
    }
    if(DEBUG){
      cerr<<i<<" lo:";
      rep(j,lo[i].size())cerr<<" "<<lo[i][j];
      cerr<<endl;
    }
    mv[i].push_back(a[i]);
    solve(mv[i],lo[i]);
    /*
    int p=a[i];
    mv[i].push_back(p);
    int pp=0;
    rep(j,tu[i].size()+1){
      int t=j==(int)tu[i].size()?q:tu[i][j];
      int nxt=j+1>=(int)tu[i].size()?q:tu[i][j+1];
      int pre;
      if(i==0)pre=0;
      else{
        int it=lower_bound(tu[i-1].begin(),tu[i-1].end(),t)-tu[i-1].begin();
        int nxt_it=lower_bound(tu[i-1].begin(),tu[i-1].end(),nxt)-tu[i-1].begin();
        pre=mv[i-1][it];
        if(it+1<mv[i-1].size())pre=max(pre,mv[i-1][it+1]);
        if(DEBUG)cerr<<i<<"-"<<j<<"-"<<pre<<"@"<<t<<endl;
        while(pp<=it){
          if(mv[i-1][pp]>=p){
            cout<<"NO"<<endl;return 0;
          }
          pp++;
        }
        pp--;
      }
      if(j>=tu[i].size())break;
      mv[i].push_back(pre<p-1?--p:++p);
      if(p>n){
        cout<<"NO"<<endl;return 0;
      }
      
    }
    */
    if(DEBUG){
      cerr<<mv[i][0];
      rep(j,tu[i].size())cerr<<" "<<tu[i][j]<<","<<mv[i][j+1];
      cerr<<endl;
      cerr<<"lo:";
      rep(j,lo[i].size())cerr<<" "<<lo[i][j];
      cerr<<endl;
    }
  }
  cout<<"YES"<<endl;
}