#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long gcd(long long x, long long y){
  if (y == 0){
    return x;
  } else {
    return gcd(y, x % y);
  }
}
int main(){
  int N, K;
  cin >> N >> K;
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
    A[i] = gcd(A[i], K);
  }
  vector<int> f;
  for (int i = 1; i * i <= K; i++){
    if (K % i == 0){
      f.push_back(i);
      if (i * i < K){
        f.push_back(K / i);
      }
    }
  }
  sort(f.begin(), f.end());
  int M = f.size();
  vector<vector<long long>> dp(N + 1, vector<long long>(M, 0));
  dp[0][0] = 1;
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      dp[i + 1][j] += dp[i][j];
      dp[i + 1][j] %= MOD;
      long long p = gcd(f[j] * A[i], K);
      int j2 = lower_bound(f.begin(), f.end(), p) - f.begin();
      dp[i + 1][j2] += dp[i][j];
      dp[i + 1][j2] %= MOD;
    }
  }
  cout << dp[N][M - 1] << endl;
}