#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint1000000007;
using vm = vector<mint>;

vector<lint> divisor(lint n) {
	vector<lint> v;
	for (lint i = 1; i*i <= n; i++) {
		if (n % i == 0) {
			v.push_back(i);
			if (i*i != n) v.push_back(n/i);
		}
	}
	sort(v.begin(), v.end());
	return v;
}

template<class T> map<T, int> coord_comp(set<T> s) {
	int a = 0;
	map<T, int> m;
	for (auto u : s) m[u] = ++a;
	return m;
}

int main() {
	lint N, K;
	cin >> N >> K;
	vi v(N);
	vin(v);

	lint a=0, b=0, c=0, x, y, z;
	vi w = divisor(K);
	lint k = w.size();
	set<lint> s;
	rep(i, k) s.insert(w[i]);
	map<lint, int> m = coord_comp(s);
	m[0] = 0;
	std::vector<map<lint, mint>> dp(N+1);
	dp[0][1] = 1;
	rep(i, N) {
		for (auto p : dp[i]) dp[i+1][p.first] += p.second;
		for (auto p : dp[i]) {
			x = __gcd(v[i], K);
			y = __gcd(x*p.first, K);
			dp[i+1][y] += p.second;
		}
	}
	if (K == 1) std::cout << dp[N][K].val()-1 << '\n';
	else std::cout << dp[N][K].val() << '\n';
}