#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

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

ll dp[2010][2010];
const int MOD=1e9+7;

vector<ll> divisor(ll x){
  set<ll> s;
  for(ll i=1;i*i<=x;i++){
    if(x%i==0){
      s.insert(i);
      s.insert(x/i);
    }
  }
  vector<ll> res;
  for(auto y:s) res.push_back(y);
  sort(ALL(res));
  return res;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,k;
  cin>>n>>k;
  vector<ll> A(n);
  rep(i,n) cin>>A[i];
  
  vector<ll> D=divisor(k);
  int d=D.size();
  map<ll,ll> m;
  rep(i,d) m[D[i]]=i;
  
  dp[0][0]=1;
  for(int i=1;i<=n;i++){
    for(int j=0;j<d;j++){
      ll tmp=D[j];
      dp[i][m[tmp]]=(dp[i][m[tmp]]+dp[i-1][m[tmp]])%MOD;
      ll b=gcd(A[i-1],k);
      ll c=k/b;
      ll a=gcd(c,tmp);
      dp[i][m[a*b]]=(dp[i][m[a*b]]+dp[i-1][m[tmp]])%MOD;
    }
  }
  if(k==1) cout<<dp[n][m[k]]-1<<endl;
  else cout<<dp[n][m[k]]<<endl;

  return 0;
}