#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;


class comb{
public:
    ll mod;
    ll mx;
    vector<ll> F;
    vector<ll> FR;
    
    
    comb(ll mod=1000000007,ll mx=100000):mod(mod),mx(mx),F(mx+1,1),FR(mx+1,1){
        mk_F();
    }
    
    ll mod_pow(ll a,ll x){
        a%=mod;
        ll ans=1;
        while(x>0){
            if(x&1){ans*=a; ans%=mod;}
            a*=a;
            a%=mod;
            x>>=1;
        }
        return ans;
    }
    
    pll Ex_gcd(ll a,ll b){
        if(b==0){return {1,0};}
        pll ret=Ex_gcd(b,a%b);
        ret.F-=a/b*ret.S;
        return {ret.S,ret.F};
    }
    
    ll prime_R(ll a){
        return mod_pow(a,mod-2);
    }
    
    ll R(ll a){
        ll ret=Ex_gcd(a,mod).F;
        ret%=mod;
        if(ret<0){ret+=mod;}
        return ret;
    }
    
    void mk_F(){
        for(ll i=1;i<=mx;i++){F[i]=F[i-1]*i%mod; FR[i]=R(F[i]);}
    }
    
    ll c(ll n,ll k){
        if(n<k){return 0;}
        if(n==k || k==0){return 1;}
        return F[n]*FR[n-k]%mod*FR[k]%mod;
    }
    
    //mod must be prime
    ll Lucas_C(ll n,ll m){
        ll ret=1;
        while(n>0 || m>0){
            ret*=c(n%mod,m%mod);
            ret%=mod;
            n/=mod; m/=mod;
        }
        return ret;
    }
    
    ll Stirling(ll n,ll k){
        ll ret=0;
        for(ll i=1;i<=k;i++){
            if((k-i)%2){ret-=c(k,i)*mod_pow(i,n)%mod;}
            else{ret+=c(k,i)*mod_pow(i,n)%mod;}
            ret%=mod;
        }
        ret*=R(F[k]);
        ret%=mod;
        if(ret<0){ret+=mod;}
        return ret;
    }
    
    ll Bell(ll n,ll k){
        ll ret=0;
        for(ll i=1;i<=k;i++){ret+=Stirling(n,i); ret%=mod;}
        return ret;
    }
};

ll n,x;
vector<ll> a;
comb C;




int main(){
    cin>>n>>x;
    a.resize(n);
    for(auto &I:a){cin>>I;}
    sort(a.begin(),a.end(),greater<ll>());
    vector<ll> dp(x+1,0);
    ll i=0;
    ll k=1;
    while(i<n && a[i]>x){(k*=n-i)%=MOD; i++;}
    if(i==n){cout<<k<<endl; return 0;}
    dp[x]=1;
    vector<ll> dp2(x+1,-1);
    ll l=0;
    for(ll j=x;j>=0;j--){
        while(l<n && a[l]>j){l++;}
        dp2[j]=l;
    }
    ll ans=0;
    for(;i<n;i++){
        for(ll t=0;t<=x;t++){
            if(t>=a[i]){
                dp[t%a[i]]+=C.c(n-dp2[t]-1,i-dp2[t])*dp[t]%MOD*C.F[i-dp2[t]]%MOD*C.c(n-i-1,dp2[t%a[i]]-i-1)%MOD*C.F[dp2[t%a[i]]-i-1]%MOD;
                dp[t%a[i]]%=MOD;
            }
            if(i+1==n){
                if(t>=a[i]){
                    ans+=C.c(n-dp2[t]-1,i-dp2[t])*dp[t]%MOD*C.F[i-dp2[t]]%MOD*C.c(n-i-1,dp2[t%a[i]]-i-1)%MOD*C.F[dp2[t%a[i]]-i-1]%MOD*(t%a[i])%MOD;
                }
                else{ans+=dp[t]*t%MOD;}
                ans%=MOD;
            }
        }
    }
    cout<<ans*k%MOD<<endl;
    
    
    
    return 0;
}


Measured memory_bytes: 3328