#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ll inf=999999999999999999;
ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
	    ll r=a%b;
        a=b;
	    b=r;
	}
	return a;
}
int main(){
    ll n,k;
    cin >> n >> k;
    vector<ll>a(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
        a[i]=gcd(k,a[i]);
    }
    vector<map<ll,ll>>dp(n);
    dp[0][1]=1;
    ll x=gcd(k,a[0]);
    dp[0][x]+=1;
    for (ll i = 1; i < n; i++)
    {
        for(auto v:dp[i-1]){
            dp[i][v.first]+=v.second;
            dp[i][v.first]%=mod;
            ll z=v.first*a[i];
            z=gcd(k,z);
            dp[i][z]+=v.second;
            dp[i][z]%=mod;
        }
    }
    cout << dp[n-1][k] << endl;
}