#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ll my_gcd(ll a,ll b){
	while(b!=0) swap(a,b),b%=a;
	return a;
}

ll my_lcm(ll a,ll b){return (a/my_gcd(a,b))*b;}


//Nの正の約数を列挙する
vector<long long> Divisors(long long N){
    vector<long long> p,q;
    long long i=1,K=0;
    while(i*i<N){
        if(N%i==0){
            p.push_back(i);
            q.push_back(N/i);
            K++;
        }
        i++;
    }
    if(i*i==N) p.push_back(i);
    for(int i=K-1;i>=0;i--){
        p.push_back(q[i]);
    }
    return p;
}

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll N,K;
	cin>>N>>K;
	auto p=Divisors(K);
	map<ll,int> rev;
	int ind=0;
	for(auto x:p) rev[x]=ind,ind++;
	int m=p.size();
	vector<ll> dp(m);
	dp[0]=1;
	rep(i,N){
		ll a;
		cin>>a;
		for(int j=m-1;j>=0;j--){
			dp[j]%=mod;
			dp[rev[p[j]*my_gcd(p[m-1-j],a)]]+=dp[j];
		}
	}
	//rep(i,m) cout<<dp[i]<<"\n";
	if(K==1) dp[0]+=(mod-1);
	cout<<dp[m-1]%mod<<"\n";
}