#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000


int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<int> A(M);
	for(int i=0;i<M;i++)scanf("%d",&A[i]);
	
	vector<int> X(M);
	for(int i=0;i<M;i++){
		if(i==0)X[i] = A[i];
		else X[i] = A[i]-A[i-1];
	}
	X.push_back(N+1 - A.back());
	
	int Q;
	cin>>Q;
	vector<int> B(Q);
	for(int i=0;i<Q;i++){
		scanf("%d",&B[i]);
		B[i]--;
	}
	
	vector<bool> bridge(M,false);
	
	for(int i=0;i<Q;i++){
		if(bridge[B[i]]){
			bridge[B[i]]=false;
			continue;
		}
		if((B[i]!=0&&bridge[B[i]-1])||(B[i]!=M-1&&bridge[B[i]+1])){
			int pre = B[i]-1;
			int nxt = B[i]+1;
			if(X[B[i]]==2&&X[B[i]+1]==2){
				bridge[B[i]]=true;
				continue;
			}
			
			if(X[B[i]]>X[B[i]+1]){
				X[B[i]]--;
				X[B[i]+1]++;
			}
			else{
				X[B[i]]++;
				X[B[i]+1]--;
			}
			
			while(pre>=0&&bridge[pre]){
				if(X[pre]>X[pre+1]){
					X[pre]--;
					X[pre+1]++;
				}
				else{
					X[pre]++;
					X[pre+1]--;
				}
				bridge[pre]=false;
				pre--;
			}
			
			while(nxt<M&&bridge[nxt]){
				if(X[nxt]>X[nxt+1]){
					X[nxt]--;
					X[nxt+1]++;
				}
				else{
					X[nxt]++;
					X[nxt+1]--;
				}
				bridge[nxt]=false;
				nxt++;
			}
			
		}
		else{
			if(X[B[i]]==1&&X[B[i]+1]==1){
				cout<<"NO"<<endl;
				return 0;
			}
			if(X[B[i]]==2&&X[B[i]+1]==2){
				bridge[B[i]]=true;
			}
			else{
				if(X[B[i]]>X[B[i]+1]){
					X[B[i]]--;
					X[B[i]+1]++;
				}
				else{
					X[B[i]]++;
					X[B[i]+1]--;
				}
			}
		}
	}
	
	cout<<"YES"<<endl;
	
	return 0;
}