#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)

using std::cin;
using std::cout;
using std::map;
using std::vector;
using ll = long long;
using mint = modint1000000007;

inline ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a%b); }

int main() {
	int n, k;
	cin >> n >> k;
	
	vector<ll> a(n);
	rep(i, n) cin >> a[i];
	rep(i, n) a[i] = gcd(a[i], k);
	
	vector<ll> f;
	for(ll i = 1; i*i <= k; ++i) {
		if (k % i == 0) {
			f.push_back(i);
			if (k/i != i) f.push_back(k/i);
		}
	}
	sort(f.begin(), f.end());
	int m = f.size();
	map<ll, int> mp;
	rep(i, m) mp[f[i]] = i;
	
	vector dp(n+1, vector<mint>(m));
	dp[0][0] = 1;
	rep(i, n) {
		rep(j, m) {
			dp[i+1][j] += dp[i][j];
			
			ll g = gcd(f[j]*a[i], k);
			dp[i+1][mp[g]] += dp[i][j];
		}
	}
	
	mint ans = dp[n][m-1];
	if (k == 1) ans -= 1;
	cout << ans.val() << '\n';
	
	return 0;
}