For this Question: Rick wants to give Morty a chapo (a super awesome treat :P). 

The only condition for Morty to get a chapo is that he should be able to reach Rick's place. Both Rick and Morty live on the number line at integer points A and B respectively. There are N types of moves M<sub>1</sub>, M<sub>2</sub>,. , M<sub>N</sub>. Morty can only take steps of size M<sub>i</sub> (1 <= i <= N) in either of the two directions on the number line (any number of times), while Rick prefers to stay at his place.

Please let Morty know if he can ever reach Rick's place and get a chapo.The first line of the input contains three integers N, A, and B denoting the total number of step sizes, the position of Rick, and the position of Morty.
The next line contains N integers M<sub>i</sub> denoting the various step sizes that Morty can take.

Constraints
1 <= N <= 200000
1 <= M<sub>i</sub> <= 10<sup>9</sup>
-10<sup>9</sup> <= A, B <= 10<sup>9</sup>Output <b>Yes</b> if Morty can reach Rick's place, else output <b>No</b>Sample Input
3 19 2
3 5 4

Sample Output
Yes

Explanation: Morty lives at position 2, while Rick lives at position 19. Morty can take the following path to reach Rick's place (there are several other ways as well):
Move M<sub>2</sub> = 5 to the right.
Move M<sub>1</sub> = 4 to the right.
Move M<sub>1</sub> = 4 to the right.
Move M<sub>1</sub> = 4 to the right.

Sample Input 2
4 10 15
10 20 30 40

Sample Output 2
No, I have written this Solution Code: def gcd(a,b):
    if a == 0:
        return b
    return gcd(b % a, a)
 
def lcm(a,b):
    return (a / gcd(a,b))* b

n,x,y=map(int,input().split())
a=list(map(int,input().split()))
ans=a[0]
for i in range(1,len(a)):
    ans=gcd(ans,a[i])
if abs(x-y)%ans==0:
    print("Yes")
else:
    print("No"), In this Programming Language: Python, Now tell me if this Code is compilable or not?