/* -*- coding: utf-8 -*-
 *
 * 1731.cc:  No.1731 Product of Subsequence - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 2000;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

/* global variables */

ll as[MAX_N];

/* subroutines */

template <typename T>
T gcd(T m, T n) {  // m > 0, n > 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%lld", as + i);

  vi ds;
  for (int p = 1; p * p <= k; p++)
    if (k % p == 0) {
      ds.push_back(p);
      int q = k / p;
      if (q != p) ds.push_back(q);
    }
  sort(ds.begin(), ds.end());
  //for (auto d: ds) printf("%d ", d); putchar('\n');

  int m = ds.size();
  vvi fs(m, vi(m, 0));

  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      int g = gcd<ll>((ll)ds[i] * ds[j], k);
      fs[i][j] = lower_bound(ds.begin(), ds.end(), g) - ds.begin();
      //printf("%d ", fs[i][j]);
    }
    //putchar('\n');
  }

  vi dp(m, 0);
  dp[0] = 1;

  for (int i = 0; i < n; i++) {
    int g = gcd<ll>(as[i], k);
    int di = lower_bound(ds.begin(), ds.end(), g) - ds.begin();

    for (int j = m - 1; j >= 0; j--)
      addmod(dp[fs[di][j]], dp[j]);
  }

  int x = dp[m - 1];
  if (k == 1) x = (x + MOD - 1) % MOD;
  printf("%d\n", x);
  return 0;
}