import heapq 
from heapq import heappop,heappush,heapify
from sys import stdin, setrecursionlimit
input = stdin.readline
readline = stdin.readline

a,b=map(int, input().split())
T=list(map(int, input().split()))
S=list(map(int, input().split()))

if sorted(T)==sorted(S):
  print('Yes')
  exit()

import math 
TT=list(set(T))
for i in range(len(TT)):
  if i==0:
    p=T[i]
  else:
    p=math.gcd(p,TT[i]-TT[i-1])
    
if p==1:
  print('Yes')
  exit()

t=T[0]
for s in S:
  q=abs(t-s)
  if q%p!=0:
    print('No')
    exit()
print('Yes')