import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;
static import std.ascii;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, M;
    scan(N, M);
    // writeln(H);
    auto A = aryread();
    auto H = new long[](N); //A.map!("a/2")();
    auto C = new long[](N); //A.map!cnt();

    foreach (i; 0 .. N)
    {
        H[i] = A[i] / 2;
        C[i] = cnt(A[i]);
    }

    bool same = true;
    if (C.length == 0 || H.length == 0)
        return;
    foreach (c; C)
        same = same && (c == C[0]);
    if (N != 1 && !same)
    {
        writeln(0);
        return;
    }
    long l = H[0];
    foreach (h; H)
    {
        l = lcm(l, h);
    }
    writeln((M / l + 1) / 2);
}

long cnt(long x)
{
    long ret;
    while (x % 2 == 0)
    {
        ret++;
        x /= 2;
    }
    return ret;
}

T lcm(T)(T a, T b)
{
    return (a * b) / max(gcd(a, b), 1);
}
