import math def main(): import sys input = sys.stdin.read().split() idx = 0 N = int(input[idx]) idx += 1 K = int(input[idx]) idx += 1 A = list(map(int, input[idx:idx+N])) if K in A: print("Yes") return def compute_gcd(arr): g = 0 for i in range(len(arr)): for j in range(i+1, len(arr)): diff = abs(arr[i] - arr[j]) g = math.gcd(g, diff) return g gcd = compute_gcd(A) if gcd == 0: if K == A[0]: print("Yes") else: print("No") return if K % gcd != 0: print("No") return print("Yes") if __name__ == "__main__": main()