Problem: Today Pari and Arya are playing a game called Remainders.

Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value <image>. There are n ancient numbers c1, c2, ..., cn and Pari has to tell Arya <image> if Arya wants. Given k and the ancient values, tell us if Arya has a winning strategy independent of value of x or not. Formally, is it true that Arya can understand the value <image> for any positive integer x?

Note, that <image> means the remainder of x after dividing it by y.

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 1 000 000) — the number of ancient integers and value k that is chosen by Pari.

The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 1 000 000).

Output

Print "Yes" (without quotes) if Arya has a winning strategy independent of value of x, or "No" (without quotes) otherwise.

Examples

Input

4 5
2 3 5 12


Output

Yes


Input

2 7
2 3


Output

No

Note

In the first sample, Arya can understand <image> because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what <image> is. For example 1 and 7 have the same remainders after dividing by 2 and 3, but they differ in remainders after dividing by 7.

Solution (in JAVA):

Solution:
import java.io.* ;
import java.util.* ;
public class Codeshefcode {
	final static long r = 1000000007 ;
	static FasterScanner ip = new FasterScanner() ;
	static PrintWriter op = new PrintWriter(System.out) ; 
	public static void main(String[] args) throws IOException{
	    int n = ip.i() ;
	    long k = ip.l() ;
	    long c[] = new long[n] ;
	    for(int i=0 ; i<n ; i++)
	    	c[i]=ip.l() ;
	    long l=1 ;
	    for(int i=0 ; i<n ; i++)
	    	l = GCD(LCM(l,c[i]),k) ;	    
	    op.println(k==l ? "Yes" : "No") ;
		Finish() ;
	}
	static long LCM(long a,long b){
		return (a*b)/(GCD(a,b)) ;
	}
	static long GCD(long a,long b){
		while(b!=0){
			long c=b ;
			b=a%b;
			a=c ; 
		}
		return a ;
	}
	static void Finish(){
		op.flush(); 
		op.close();
	}	
}
@SuppressWarnings("serial") 
class MyList extends ArrayList<Integer>{
	
}
class pair implements Comparable<pair>{
	private int x ;
	private int y ;
	pair(int a,int b){
		x=a ;
		y=b ;		
	}
	public int x(){
		return x ;
	}
	public int y(){
		return y ;
	}
	public int compareTo(pair p){
		int l = Long.compare(this.x,p.x) ;
		if(l!=0)
			return l ;
		return Long.compare(this.y,p.y) ;
	}
}
class FasterScanner { 
    private InputStream mIs;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars; 
    public FasterScanner() {
        this(System.in);
    } 
    public FasterScanner(InputStream is) {
        mIs = is;
    } 
    public int read() {
        if (numChars == -1) 
            throw new InputMismatchException();    
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = mIs.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0) 
                return -1;            
        }
        return buf[curChar++];
    } 
    public String nextLine() {
        int c = read();
        while (isSpaceChar(c)) 
            c = read();        
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isEndOfLine(c));
        return res.toString();
    } 
    public String S() {
        int c = read();
        while (isSpaceChar(c)) 
            c = read();        
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        }while (!isSpaceChar(c));
        return res.toString();
    } 
    public long l() {
        int c = read();
        while (isSpaceChar(c)) 
            c = read();        
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;
        do{
           if (c < '0' || c > '9') 
               throw new InputMismatchException();            
           res *= 10;
           res += c - '0';
           c = read();
        }while(!isSpaceChar(c));
        return res * sgn;
    } 
    public int i() {
        int c = read();
        while (isSpaceChar(c))
            c = read();        
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        int res = 0;
        do{
            if (c < '0' || c > '9') 
                throw new InputMismatchException();            
            res *= 10;
            res += c - '0';
            c = read();
        }while (!isSpaceChar(c));
        return res * sgn;
    } 
    public boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    } 
    public boolean isEndOfLine(int c) {
        return c == '\n' || c == '\r' || c == -1;
    } 
}