use std::collections::HashMap;

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn main() {
    input! {
        n: usize,
        h: usize,
        a: [usize; n]
    }

    let mut map = HashMap::new();
    let mut i = 2;
    let mut m = h;

    while i * i <= m {
        while m % i == 0 {
            m /= i;
            if map.contains_key(&i) {
                let x = map.get_mut(&i).unwrap();
                *x += 1;
            } else {
                map.insert(i, 1);
            }
        }
        i += 1;
    }
    if m > 1 {
        if map.contains_key(&m) {
            let x = map.get_mut(&m).unwrap();
            *x += 1;
        } else {
            map.insert(m, 1);
        }
    }

    for i in 0..n {
        if h == a[i] {
            println!("YES");
            return;
        }
        if map.contains_key(&a[i]) {
            let x = map.get_mut(&a[i]).unwrap();
            *x -= 1;
        }
    }

    for (_, v) in &map {
        if 0 < *v {
            println!("NO");
            return;
        }
    }

    println!("YES");
}