#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, K;
  cin >> N >> K;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }

  if (K == 1)
    FINALANS((mint(2).pow(N) - 1).val());

  vector<ll> D;
  for (ll d = 1; d * d <= K; d++)
  {
    if (K % d == 0)
    {
      D.push_back(d);
      if (d != K / d)
        D.push_back(K / d);
    }
  }
  sort(D.begin(), D.end());
  ll M = D.size();
  map<ll, ll> mp;
  for (ll i = 0; i < M; i++)
  {
    mp[D.at(i)] = i;
    //cerr << D.at(i) << endl;
  }

  vector<vector<mint>> dp(N + 1, vector<mint>(M, 0));
  dp.at(0).at(0) = 1;
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j < M; j++)
    {
      ll d = D.at(j);
      ll nd = __gcd(d * __gcd(A.at(i), K), K);
      ll nj = mp[nd];
      dp.at(i + 1).at(nj) += dp.at(i).at(j);
      dp.at(i + 1).at(j) += dp.at(i).at(j);

      //cerr << j << " " << d << " " << A.at(i) << " " << nd << " " << nj << endl;
    }
  }

  mint ans = dp.at(N).at(M - 1);
  cout << ans.val() << endl;

  /*
  for (ll i = 0; i < N + 1; i++)
  {
    for (ll j = 0; j < M; j++)
    {
      cerr << dp.at(i).at(j).val() << " ";
    }
    cerr << endl;
  }
  //*/
}