#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
signed main(){
  ll N,K;cin>>N>>K;
  vector<ll>divisor;
  ll d=1;
  while(d*d<=K){
    if(K%d==0){
      divisor.push_back(d);
      if(d*d<K)divisor.push_back(K/d);
    }
    d++;
  }
  sort(ALL(divisor));
  vector<ll>A(N);REP(i,N)cin>>A[i];
  ll M=divisor.size();
  vector<vector<mint>>DP(N+1,vector<mint>(M));DP[0][0]=1;
  REP(i,N){
    DP[i+1]=DP[i];
    ll g=__gcd(K,A[i]);
    REP(j,M)DP[i+1][LB(divisor,__gcd(K/g,divisor[j])*g)]+=DP[i][j];
  }
  //REP(i,N+1){REP(j,M)cout<<DP[i][j].val()<<" ";cout<<endl;}
  if(K==1)DP[N][M-1]--;
  cout<<DP[N][M-1].val()<<endl;
  return 0;
}