#include #if __has_include() #include using namespace atcoder; #endif #define rep(i, n) for (int i = 0; i < (n); ++i) using std::cin; using std::cout; using std::gcd; using std::unordered_map; using std::vector; using ll = long long; using mint = modint1000000007; int main() { int n, k; cin >> n >> k; vector a(n); rep(i, n) cin >> a[i]; rep(i, n) a[i] = gcd(a[i], k); vector> dp(n+1); dp[0][1] = 1; rep(i, n) { for (auto [j, x] : dp[i]) { // 不取 a[i] dp[i+1][j] += x; // 取 a[i] ll g = gcd(j*a[i], k); dp[i+1][g] += x; } } mint ans = dp[n][k]; if (k == 1) ans -= 1; cout << ans.val() << '\n'; return 0; }