import java.io.*; import java.util.*; public class Main { static ArrayList> dp = new ArrayList<>(); static int[] values; static int k; static final int MOD = 1000000007; static HashMap> gcdDP = new HashMap<>(); public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); if (k == 1) { System.out.println(pow(2, n) - 1); return; } values = new int[n]; for (int i = 0; i < n; i++) { dp.add(new HashMap<>()); values[i] = (int)getGCD(sc.nextLong(), k); } System.out.println((pow(2, n) - dfw(n - 1, k) + MOD) % MOD); } static int dfw(int idx, int key) { if (key == 1) { return 0; } if (idx < 0) { return 1; } if (!dp.get(idx).containsKey(key)) { int ans = (dfw(idx - 1, key) + dfw(idx - 1, key / getGCD(key, values[idx]))) % MOD; dp.get(idx).put(key, ans); } return dp.get(idx).get(key); } static long getGCD(long x, long y) { if (x % y == 0) { return y; } else { return getGCD(y, x % y); } } static int getGCD(int x, int y) { if (!gcdDP.containsKey(x)) { gcdDP.put(x, new HashMap<>()); } if (!gcdDP.get(x).containsKey(y)) { int gcd; if (x % y == 0) { gcd = y; } else { gcd = getGCD(y, x % y); } gcdDP.get(x).put(y, gcd); } return gcdDP.get(x).get(y); } static long pow(long x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }