#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define LP pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
template<class T>
void chmax(T& a, T b) { a = max(a, b); };
template<class T>
void chmin(T& a, T b) { a = min(a, b); };

using mint = modint1000000007;

int main() {
  int n, k;
  cin >> n >> k;
  vector<ll> a(n);
  rep(i,n) cin >> a[i];
  vector<int> kdiv;
  for (int i = 1; i*i <= k; i++) {
    if (k%i==0) {
      if (i*i==k) kdiv.pb(i);
      else {
        kdiv.pb(i);
        kdiv.pb(k/i);
      }
    }
  }
  vector<ll> g(n);
  rep(i,n) {
    g[i] = gcd(a[i],k);
  }

  sort(all(kdiv));
  int m = kdiv.size();
  vector dp(n+1, vector<mint>(m));
  dp[0][0] = 1;
  rep(i,n) {
    rep(j,m) {
      dp[i+1][j] += dp[i][j];
      for (int l = m-1; l >= j; l--) {
        if ((g[i]*kdiv[j])%kdiv[l] == 0) {
          dp[i+1][l] += dp[i][j];
          break;
        }
      }
    }
  }

  cout << dp[n][m-1].val() << endl;




  
  return 0;
}