#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}

//istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
//istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }

static const ll INF=1e18+7;
static const double PI=acos(-1);
static const double EPS=1e-10;

using v1d=vector<ll>;
using v2d=vector<v1d>;
using v3d=vector<v2d>;
using v4d=vector<v3d>;

vector<pll>prime_factrization(ll n){
  vector<pll>res;
  for(ll i=2;i*i<=n;i++){
    ll cnt=0;
    while(n%i==0){
      cnt++;
      n/=i;
    }
    if(cnt)res.push_back({i,cnt});
  }
  if(n>1)res.push_back({n,1});
  return res;
}

int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
    
  ll N,K;cin>>N>>K;
  v1d a(N);cin>>a;
  
  using mint=modint1000000007;
  if(K==1){pt(mint(2).pow(N)-1);return 0;};
  
  vector<pll>prim=prime_factrization(K);
  ll M=prim.size();
  
  v2d cnt(N);
  for(ll i=0;i<N;i++){
    v1d v;
    for(auto [p,_]:prim){
      ll t=0;
      while(a[i]%p==0){
        t++;
        a[i]/=p;
      }
      v.push_back(t);
    }
    cnt[i]=v;
  }
  
  auto convert=[&](v1d v){
    ll res=0;
    for(ll i=0;i<M-1;i++){
      ll base=prim[i+1].second+1;
      res+=v[i];
      res*=base;
    }
    res+=v.back();
    return res;
  };
  
  auto rev=[&](ll S){
    v1d res;
    for(ll i=M-1;i>=1;i--){
      ll base=prim[i].second+1;
      res.push_back(S%base);
      S/=base;
    }
    res.push_back(S);
    reverse(all(res));
    return res;
  };
  
  ll S=1;
  for(ll i=0;i<M;i++)S*=prim[i].second+1;
  vector<vector<mint>>dp(N+1,vector<mint>(S));
  dp[0][0]=1;
  for(ll i=0;i<N;i++){
    for(ll j=0;j<S;j++){
      
      dp[i+1][j]+=dp[i][j];
      
      v1d v=rev(j);
      for(ll k=0;k<M;k++){
        v[k]+=cnt[i][k];
        chmin(v[k],prim[k].second);
      }
        
      ll nxt=convert(v);
      if(nxt<S)dp[i+1][nxt]+=dp[i][j];
      
    }
  }
  
  pt(dp[N][S-1]);
  
}