// https://atcoder.jp/contests/abc150/tasks/abc150_d
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
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)*}
    };
}

#[allow(unused_macros)]
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)*}
    };

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

#[allow(unused_macros)]
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, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

fn gcd(a: i64, b: i64) -> i64 {
    if b == 0 {
        a
    } else {
        gcd(b, a%b)
    }
}

fn lcm(a: i64, b: i64) -> i64 {
    let g = gcd(a, b);
    if (a / g) * b > 1e9 as i64 + 100 {
        return -1;
    }
    (a / g) * b
}

fn lcm_list(a: Vec<i64>) -> i64 {
    a.into_iter().fold(1, |a,b| ifv!(a == -1, -1, lcm(a, b)))
}

fn solve(upto: i64, g: i64) -> i64 {
    // g, 3g, 5g...
    if upto < g {
        return 0;
    }
    let z = upto - g;
    1 + z / (2 * g)
}

fn try_naive(a: Vec<i64>) {
    let mut x = a[0] * 3 / 2;
    while x < 100000 {
        let mut ok = true;
        for &c in &a {
            ok &= x % c == c / 2;
        }
        if ok {
            debug!(x);
        }
        x += a[0];
    }
    let half = a.iter().cloned().map(|x| x/2).collect::<Vec<_>>();
    let mut g = lcm_list(half.clone());
    debug!("end", g);
}

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

    a.sort();
    a.dedup();

    // try_naive(a.clone());

    let n = a.len();
    let mut k = vec![];
    for i in 0..n {
        let mut k0 = 0i64;
        let mut aa = a[i];
        while aa % 2 == 0 {
            aa /= 2;
            k0 += 1;
        }
        k.push(k0);
    }
    k.sort();
    k.dedup();
    if k.len() != 1 {
        println!("0");
        return;
    }

    let half = a.iter().cloned().map(|x| x/2).collect::<Vec<_>>();
    let mut g = lcm_list(half.clone());

    if g == -1 {
        println!("0");
        return;
    }

    let to = solve(m, g);
    println!("{}", max(to, 0));
}


Measured memory_bytes: 6396