def gcd(a, b):
	m = min(a, b)
	M = max(a, b)
	while m > 0:
		m, M = M % m, m
	return M

def gcd_array(A):
	ret = 0
	for a in A:
		ret = gcd(a, ret)
	return ret

p, q = map(int, input().split())
T = list(map(int, input().split()))
S = list(map(int, input().split()))
if gcd_array(S) % gcd_array(T) == 0:
	print('Yes')
else:
	print('No')