#include <stdio.h>

int N, M, Q, A[200200], L[200200], R[200200];

int main()
{
	scanf("%d %d", &N, &M);
	for (int i = 1; i <= M; i++){
		scanf ("%d", &A[i]);
		A[i] -= i;
		L[i] = R[i] = A[i];
	}
	N -= M;
	L[M + 1] = R[M + 1] = N;

	scanf ("%d", &Q); while (Q--){
		int i; scanf ("%d", &i);
		L[i]--; R[i]++;
		for (int j = i; j <= N; j++){
			if (L[j] < L[j - 1]) L[j] += 2;
			else break;
			if (L[j] > R[j]){
				puts("NO");
				return 0;
			}
		}
		for (int j = i; j >= 1; j--){
			if (R[j] > R[j + 1]) R[j] -= 2;
			else break;
			if (L[j] > R[j]){
				puts("NO");
				return 0;
			}
		}
	}
	puts("YES");
	return 0;
}